415 search results - page 64 / 83 » Tree Unification Grammar |
ACL
2008
13 years 10 months ago
2008
Underspecification-based algorithms for processing partially disambiguated discourse structure must cope with extremely high numbers of readings. Based on previous work on dominan...
AML
2010
13 years 8 months ago
2010
We investigate the development of terms during cut-elimination in first-order logic and Peano arithmetic for proofs of existential formulas. The form of witness terms in cut-free p...
SAS
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
DCC
2007
IEEE
14 years 8 months ago
2007
IEEE
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
PADL
2001
Springer
14 years 1 months ago
2001
Springer
The goal of this project is to develop solutions to enhance interoperability between bioinformatics applications. Most existing applications adopt different data formats, forcing ...