Loukanova, 2011 - Google Patents
Semantics with the language of acyclic recursion in constraint-based grammarLoukanova, 2011
View PDF- Document ID
- 2688389528744277653
- Author
- Loukanova R
- Publication year
- Publication venue
- Bio-Inspired Models for Natural and Formal Languages
External Links
Snippet
Computational semantics in general, and especially for contemporary grammar theories of NL, is an active research area. Largely, incorporating computational semantics into formal syntax, and in particular, in computational grammar systems for natural language …
- 125000002015 acyclic group 0 title abstract description 12
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
- G06F17/27—Automatic analysis, e.g. parsing
- G06F17/2785—Semantic analysis
- G06F17/279—Discourse representation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
- G06F17/27—Automatic analysis, e.g. parsing
- G06F17/2705—Parsing
- G06F17/271—Syntactic parsing, e.g. based on context-free grammar [CFG], unification grammars
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
- G06F17/28—Processing or translating of natural language
- G06F17/2872—Rule based translation
- G06F17/2881—Natural language generation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
- G06F17/27—Automatic analysis, e.g. parsing
- G06F17/2765—Recognition
- G06F17/277—Lexical analysis, e.g. tokenisation, collocates
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
- G06F17/21—Text processing
- G06F17/22—Manipulating or registering by use of codes, e.g. in sequence of text characters
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
- G06F17/27—Automatic analysis, e.g. parsing
- G06F17/274—Grammatical analysis; Style critique
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
- G06F17/27—Automatic analysis, e.g. parsing
- G06F17/2795—Thesaurus; Synonyms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
- G06F17/28—Processing or translating of natural language
- G06F17/2809—Data driven translation
- G06F17/2827—Example based machine translation; Alignment
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
- G06F8/43—Checking; Contextual analysis
- G06F8/436—Semantic checking
- G06F8/437—Type checking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
- G06F8/41—Compilation
- G06F8/42—Syntactic analysis
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Lewis et al. | A* CCG parsing with a supertag-factored model | |
US7231341B2 (en) | System and method for natural language generation | |
Muskens | Order-independence and underspecification | |
Novák | A New Form of Humor―Mapping Constraint-Based Computational Morphologies to a Finite-State Representation. | |
Loukanova | Semantics with the language of acyclic recursion in constraint-based grammar | |
Tablan et al. | User-friendly ontology authoring using a controlled language. | |
Bohnet et al. | Generating non-projective word order in statistical linearization | |
Sandillon-Rezer et al. | Using tree transducers for grammatical inference | |
Hall | A probabilistic part-of-speech tagger with suffix probabilities | |
Woliński et al. | A new version of the Składnica treebank of Polish harmonised with the Walenty valency dictionary | |
Vermaat | The minimalist move operation in a deductive perspective | |
Ruprecht et al. | Implementation of a Chomsky-Schützenberger n-best parser for weighted multiple context-free grammars | |
Loukanova et al. | On the syntax-semantics interface of argument marking prepositional phrases | |
Grammar | Chapter V Semantics with the Language of Acyclic Recursion in Constraint-Based Grammar Roussanka Loukanova | |
Loukanova | Minimal recursion semantics and the language of acyclic recursion | |
Loukanova | Constraint based grammar and semantic representation with the language of acyclic recursion | |
Loukanova | From Montague's rules of quantification to minimal recursion semantics and the language of acyclic recursion | |
Haque et al. | Parsing Bangla Using LFG: An Introduction | |
Hefny et al. | Incremental combinatory categorial grammar and its derivations | |
Dods | Automatically inferring grammar specifications for adnominal possession from interlinear glossed text | |
Daciuk et al. | Finite automata for compact representation of language models in NLP | |
Dozat | Arc-factored biaffine dependency parsing | |
Buszkowski | Syntactic categories and types: Ajdukiewicz and modern categorial grammars | |
Hanneforth | fsm2–A scripting language interpreter for manipulating weighted finite-state automata | |
Kornai | Logical types and linguistic types |