• Refine your search:
  • 
    Keyword:
    
    • Linguistics (3)
    • SYNTAX (3)
    • *ATTENTION (1)
    • *COMPUTATIONAL LINGUISTICS (1)
    • *GRAMMARS (1)
    • *MACHINE TRANSLATION (1)
    • *NATURAL LANGUAGE (1)
    • *PARSERS (1)
    • *SEMANTICS (1)
    • *TEXT PROCESSING (1)
    •   more
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium:
    
    • Online (3)
  • 
    Type
  • 
    BLLDB-Access

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 3 of 3 1 Language Processing Research and Technology - New Directions Joshi, Aravind K. In: DTIC AND NTIS (1998) BASE Show details 2 Centering: A Framework for Modelling the Local Coherence of Discourse Grosz, Barbara J.; Joshi, Aravind K.; Weinstein, Scott In: DTIC AND NTIS (1995) BASE Show details 3 Two Recent Developments in Tree Adjoining Grammars: Semantics and Efficient Processing Schabes, Yves; Joshi, Aravind K. In: DTIC (1990) Abstract: ABSTRACT During the past year there have been two very significant developments in the area of Tree Adjoining Grammars (TAGs). The first development is a variant of TAGs, called synchronous TAGs, which allows TAG to be used beyond the confines of syntax by characterizing correspondences between languages. The formalism's intended usage is to relate expressions of natural languages to their associated semantics represented by a logical form language in TAG, or to their translates in another natural language. The formalism is incremental and inherently nondirectional. We will show by detailed examples the working of synchronous TAGs and some of its applications, for example in generation and in machine translation. The second development is the design of LR-style parsers for TAGs. LR parsing strategies evolved out of the original work of Knuth. Even though they are not powerful enough for NLP, they have found use in natural language processing 0VLP) by solving by pseudo-parallelism conflicts between multiple choices. This gives rise to a class of powerful yet efficient parsers for natural language. In order to extend the LR techniques to TAGs it is necessary to find bottom-up automaton that is exactly equivalent to TAGs. This is precisely what has been achieved by the discovery of the Bottom-up Embedded Push Down Automaton (BEPDA). Using BEPDA, deterministic left to fight parsers for the Tree Adjoining Languages have been developed. ; Sponsored in part by NSF contract IRI84-10413. Keyword: *GRAMMARS; *MACHINE TRANSLATION; *NATURAL LANGUAGE; *SEMANTICS; EFFICIENCY; Human Factors Engineering & Man Machine System; LABELS; Linguistics; PARSERS; PROCESSING; STRATEGY; SYNTAX; TREES; VARIATIONS URL: http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA458891 http://www.dtic.mil/docs/citations/ADA458891 BASE Hide details

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 3 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0