Results 1 - 10 of 8,634

Parameterless information extraction using (k,l)-contextual tree languages

by Stefan Raeymaekers, Maurice Bruynooghe - In BNAIC 2004 - Proceedings of the 16th Belgian-Dutch Conference on Artificial Intelligence , 2004
"... Recently, several wrapper induction algorithms for structured documents have been introduced. They are based on contextual tree languages and learn from positive examples only but have the disadvantage that they need parameters. To obtain the optimal parameter setting, they use precision and recall. ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Recently, several wrapper induction algorithms for structured documents have been introduced. They are based on contextual tree languages and learn from positive examples only but have the disadvantage that they need parameters. To obtain the optimal parameter setting, they use precision and recall

Wrapper Induction: Learning (k,l)-Contextual Tree Languages Directly as Unranked Tree Automata

by Stefan Raeymaekers, Maurice Bruynooghe
"... Abstract. A (k, l)-contextual tree language can be learned from positive examples only; such languages have been successfully used as wrappers for information extraction from web pages. This paper shows how to represent the wrapper as an unranked tree automaton and how to construct it directly from ..."
Abstract - Add to MetaCart
Abstract. A (k, l)-contextual tree language can be learned from positive examples only; such languages have been successfully used as wrappers for information extraction from web pages. This paper shows how to represent the wrapper as an unranked tree automaton and how to construct it directly from

Learning (k,l)-contextual tree languages for information extraction from web pages

by Stefan Raeymaekers, Maurice Bruynooghe, Jan Van Den Bussche , 2008
"... This paper introduces a novel method for learning a wrapper for extraction of information from web pages, based upon (k, l)-contextual tree languages. It also introduces a method to learn good values of k and l based on a few positive and negative examples. Finally, it describes how the algorithm c ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
This paper introduces a novel method for learning a wrapper for extraction of information from web pages, based upon (k, l)-contextual tree languages. It also introduces a method to learn good values of k and l based on a few positive and negative examples. Finally, it describes how the algorithm

Semantics of Context-Free Languages

by Donald E. Knuth - In Mathematical Systems Theory , 1968
"... "Meaning " may be assigned to a string in a context-free language by defining "at-tributes " of the symbols in a derivation tree for that string. The attributes can be de-fined by functions associated with each production in the grammar. This paper examines the implications of th ..."
Abstract - Cited by 569 (0 self) - Add to MetaCart
"Meaning " may be assigned to a string in a context-free language by defining "at-tributes " of the symbols in a derivation tree for that string. The attributes can be de-fined by functions associated with each production in the grammar. This paper examines the implications

CIL: Intermediate language and tools for analysis and transformation of C programs

by George C. Necula, Scott Mcpeak, Shree P. Rahul, Westley Weimer - In International Conference on Compiler Construction , 2002
"... Abstract. This paper describes the CIntermediate Language: a highlevel representation along with a set of tools that permit easy analysis and source-to-source transformation of C programs. Compared to C, CIL has fewer constructs. It breaks down certain complicated constructs of C into simpler ones, ..."
Abstract - Cited by 533 (11 self) - Add to MetaCart
, and thus it works at a lower level than abstract-syntax trees. But CIL is also more high-level than typical intermediate languages (e.g., three-address code) designed for compilation. As a result, what we have is a representation that makes it easy to analyze and manipulate C programs, and emit them in a

The lexical nature of syntactic ambiguity resolution

by Maryellen C Macdonald, Neal J Pearlmutter, Mark S Seidenberg - Psychological Review , 1994
"... Ambiguity resolution is a central problem in language comprehension. Lexical and syntactic ambiguities are standardly assumed to involve different types of knowledge representations and be resolved by different mechanisms. An alternative account is provided in which both types of ambiguity derive fr ..."
Abstract - Cited by 557 (24 self) - Add to MetaCart
of apparently conflicting results concerning the roles of lexical and contextual information in sentence processing, explains differences among ambiguities in terms of ease of resolution, and provides a more unified account of language comprehension than was previously available. One of the principal goals

Testing Equivalences for Processes

by R. De Nicola, M. C. B. Hennessy - Theoretical Computer Science , 1984
"... Abstract. Given a set of processes and a set of tests on these processes we show how to define in a natural way three different eyuitalences on processes. ThesP equivalences are applied to a particular language CCS. We give associated complete proof systems and fully abstract models. These models ha ..."
Abstract - Cited by 526 (37 self) - Add to MetaCart
Abstract. Given a set of processes and a set of tests on these processes we show how to define in a natural way three different eyuitalences on processes. ThesP equivalences are applied to a particular language CCS. We give associated complete proof systems and fully abstract models. These models

Efficient semantic matching

by Fausto Giunchiglia, Mikalai Yatskevich, Enrico Giunchiglia , 2004
"... We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into prop ..."
Abstract - Cited by 855 (68 self) - Add to MetaCart
We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes

Proof verification and hardness of approximation problems

by Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - IN PROC. 33RD ANN. IEEE SYMP. ON FOUND. OF COMP. SCI , 1992
"... We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts with probabilit ..."
Abstract - Cited by 797 (39 self) - Add to MetaCart
We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of random bits and by examining a constant number of bits in the proof. If a string is in the language, then there exists a proof such that the verifier accepts

Symbolic Model Checking for Real-time Systems

by Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, Sergio Yovine - INFORMATION AND COMPUTATION , 1992
"... We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an ..."
Abstract - Cited by 578 (50 self) - Add to MetaCart
We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given
Results 1 - 10 of 8,634