| 21 |
Towards Linguistically Generalizable NLP Systems: A Workshop and Shared Task ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 23 |
STREAMLInED Challenges: Aligning Research Interests with Shared Tasks
|
|
|
|
In: 2nd Workshop on the Use of Computational Methods in the Study of Endangered Languages, March 6-7, 2017. Honolulu, Hawai‘i, USA (2017)
|
|
BASE
|
|
Show details
|
|
|
| 24 |
Automated Gloss Mapping for Inferring Grammatical Properties
|
|
|
|
BASE
|
|
Show details
|
|
|
| 29 |
Are We There Yet?: The Development of a Corpus Annotated for Social Acts in Multilingual Online Discourse
|
|
|
|
In: Dialogue & Discourse; Vol 4 No 2 (2013); 1-33 ; 2152-9620 (2013)
|
|
BASE
|
|
Show details
|
|
|
| 32 |
Deriving a lexicon for a precision grammar from language documentation resources: a case study of Chintang ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 33 |
From Database to Treebank: On Enhancing Hypertext Grammars with Grammar Engineering and Treebank Search
|
|
|
|
BASE
|
|
Show details
|
|
|
| 34 |
From Database to Treebank: On Enhancing Hypertext Grammars with Grammar Engineering and Treebank Search
|
|
|
|
BASE
|
|
Show details
|
|
|
| 35 |
Deriving a lexicon for a precision grammar from language documentation resources: a case study of Chintang
|
|
|
|
In: Bender, Emily M; Schikowski, Robert; Bickel, Balthasar (2012). Deriving a lexicon for a precision grammar from language documentation resources: a case study of Chintang. In: Kay, M; Boitet, C. Proceedings of the 24th International Conference on Computational Linguistics (COLING). Mumbai: Association for Computational Linguistics, 247-262. (2012)
|
|
BASE
|
|
Show details
|
|
|
| 36 |
An analysis of translation divergence patterns using PanLex translation pairs
|
|
|
|
BASE
|
|
Show details
|
|
|
| 37 |
Array TFS storage for unification grammars
|
|
|
|
Abstract:
Thesis (Master's)--University of Washington, 2012 ; Constraint-based grammar formalisms such as Head-Driven Phrase Structure Grammar (HPSG) model linguistic entities as sets of attribute-value tuples headed by types drawn from a connected multiple-inheritance hierarchy. These typed feature structures (TFSes) describe directed graphs, allowing for the application of graph-theoretic analyses. In particular, graph unification --the computation of the most general structure that is consistent with a set of argument graphs (if such a structure exists)--can be interpreted as expressing the satisfiability and combination functions for the represented linguistic entities, thus providing a principled method for describing syntactic elaboration. In competent natural language grammars, however, the graphs are typically large and numerous, and computational efficiency is a key engineering concern. This thesis describes a method for the storage of typed feature structures where each TFS comprises a self-contained, contiguous memory allocation with a tabular internal structure. Also detailed is an efficient unification algorithm for this storage mode. The techniques are evaluated in agree , a new managed-execution concurrent unification chart parser which supports both syntactic analysis (parsing) and surface realization (generation) within the framework of the DELPH-IN (Deep Linguistic Processing with HPSG Initiative) joint reference formalism.
|
|
Keyword:
Computer science; Linguistics; typed feature structure; unification grammar
|
|
URL: http://hdl.handle.net/1773/20770
|
|
BASE
|
|
Hide details
|
|
|
| 38 |
It's Only Morpho-Logical: Modeling Agreement in Cross-Linguistic Dependency Parsing
|
|
|
|
BASE
|
|
Show details
|
|
|
| 39 |
The Syntactic Exponence of Sentential Negation: a model for the LinGO Grammar Matrix
|
|
|
|
BASE
|
|
Show details
|
|
|
| 40 |
From IGT to precision grammar: French verbal morphology
|
|
|
|
In: LSA Annual Meeting Extended Abstracts; Vol 3: LSA Annual Meeting Extended Abstracts 2012; 9:1-5 ; 2377-3367 (2012)
|
|
BASE
|
|
Show details
|
|
|
|
|
