3359 search results - page 153 / 672 » A Simplified Idea Algorithm |
139
click to vote
ANLP
2000
15 years 5 months ago
2000
We present an algorithm and a tool for automatically revising grammars for natural language processing (NLP) systems to disallow specifically identified sentences or sets of sente...
135
click to vote
ACL
1998
15 years 5 months ago
1998
Determining the attachments of prepositions and subordinate conjunctions is a key problem in parsing natural language. This paper presents a trainable approach to making these att...
141
click to vote
AAAI
1996
15 years 5 months ago
1996
In recent years, compositional modeling and selfexplanatory simulation techniques have simplified the process of building dynamic simulators of physical systems. Building steady-s...
128
click to vote
EACL
1993
ACL Anthology
15 years 5 months ago
1993
ACL Anthology
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
156
click to vote
CADE
2010
Springer
15 years 5 months ago
2010
Springer
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...