Name
Abstract | ||
|---|---|---|
Default unification has been used in several linguistic applications. Most of them have utilized defaults at a metalevel, as part of an extended description language. We propose that allowing default unification to be a fully integrated part of a typed feature structure system requires default unification to be a binary, order independent function, so that it acquires the perspicuity and declarativity familiar from normal unification-based frameworks. Furthermore, in order to respect the behaviour of defaults, default unification should allow default reentrancies and values on more general types to be overridden by conflicting default information on more specific types. We define what we believe is the first version of default unification to fully satisfy these criteria, and argue that it can improve the representation of a range of phenomena in syntax, semantics and the lexico-pragmatic interface. |
Year | Venue | Keywords |
|---|---|---|
1999 | Computational Linguistics | general type,constraint-based framework,extended description language,lexico-pragmatic interface,feature structure system,utilized default,default reentrancies,order independent function,integrated part,conflicting default information,default unification,default representation,satisfiability |
Field | DocType | Volume |
Computer science,Unification,Feature structure,Default,Natural language processing,Formal grammar,Artificial intelligence,Syntax,Semantics,Binary number | Journal | 25 |
Issue | ISSN | Citations |
1 | 0891-2017 | 11 |
PageRank | References | Authors |
3.71 | 21 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| alex lascarides | 1 | 503 | 68.41 |
| Ann Copestake | 2 | 862 | 95.10 |