Sciweavers

2475 search results - page 111 / 495
» On the accuracy of language trees
Sort
View
PEPM
1993
ACM
15 years 10 months ago
Polyvariant Binding-Time Analysis For Applicative Languages
Binding-time analysis is a crucial component of an ofine partial evaluator. The accuracy of the binding-time information that it produces determines the degree of specialization o...
Charles Consel
AI
2007
Springer
15 years 6 months ago
Determining the consistency of partial tree descriptions
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
Manuel Bodirsky, Martin Kutz
IPL
2008
147views more  IPL 2008»
15 years 6 months ago
Streaming tree automata
Streaming validation and querying of XML documents are often based on automata for tree-like structures. We propose a new notion of streaming tree automata in order to unify the t...
Olivier Gauwin, Joachim Niehren, Yves Roos
NAACL
2003
15 years 7 months ago
Cooperative model-based language understanding
In this paper, we propose a novel Cooperative Model for natural language understanding in a dialogue system. We build this based on both Finite State Model (FSM) and Statistical L...
Donghui Feng
CORR
1999
Springer
76views Education» more  CORR 1999»
15 years 6 months ago
Resolving Part-of-Speech Ambiguity in the Greek Language Using Learning Techniques
This article investigates the use of Transformation-Based Error-Driven learning for resolving part-of-speech ambiguity in the Greek language. The aim is not only to study the perf...
Georgios Petasis, Georgios Paliouras, Vangelis Kar...