In this paper we propose a unified notation for representing rules in the natural language processing (NLP) and information retrieval (IR) systems. Our notation is both flexible and compact and can be used in a wide variety of tasks. This technique was successfully used in different NLP and IR modules such as input text preformatter, sentence boundary disambiguation, set phrase extraction, constraint grammar, rule based part-of-speech tagging, case sensitive tagging, shallow parsing, transformational grammar, noun phrase normalization, uninformative noun phrase filter, word sense disambiguation, anaphora resolution and others
In this paper, a new formalism that permits to represent a non-trivial class of context-sensitive la...
In order to extend the potential of application of the syntactic approach to pattern recognition, th...
Natural language search from a database makes it possible for non technical users to fetch informati...
In this paper we propose a unified notation for representing rules in the natural language processin...
A usage of regular expressions to search text is well known and understood as a useful technique. Re...
This paper introduces a technique that allows to build deterministic finite-state automata from word...
We consider the problem of translating natu-ral language text queries into regular expres-sions whic...
In this paper, a natural language approach to Information Retrieval (IR) and Information Filtering (...
We consider the problem of translating natural language text queries into regular expressions which ...
This paper presents a set of mathematical and computational tools for manipulating and rea-soning ab...
This paper presents an approach of a part-of-speech (POS) tagging based on subtraction of regular la...
Translating natural language descriptions into executable programs is a fundamental problem for comp...
Abstract. The paper presents the idea of using regular expressions in translation systems based on t...
Abstract--In this paper, a new formalism that permits to represent a non-trivial class of context-se...
In this paper we define and study regular expressions for data words. We first define regular expres...
In this paper, a new formalism that permits to represent a non-trivial class of context-sensitive la...
In order to extend the potential of application of the syntactic approach to pattern recognition, th...
Natural language search from a database makes it possible for non technical users to fetch informati...
In this paper we propose a unified notation for representing rules in the natural language processin...
A usage of regular expressions to search text is well known and understood as a useful technique. Re...
This paper introduces a technique that allows to build deterministic finite-state automata from word...
We consider the problem of translating natu-ral language text queries into regular expres-sions whic...
In this paper, a natural language approach to Information Retrieval (IR) and Information Filtering (...
We consider the problem of translating natural language text queries into regular expressions which ...
This paper presents a set of mathematical and computational tools for manipulating and rea-soning ab...
This paper presents an approach of a part-of-speech (POS) tagging based on subtraction of regular la...
Translating natural language descriptions into executable programs is a fundamental problem for comp...
Abstract. The paper presents the idea of using regular expressions in translation systems based on t...
Abstract--In this paper, a new formalism that permits to represent a non-trivial class of context-se...
In this paper we define and study regular expressions for data words. We first define regular expres...
In this paper, a new formalism that permits to represent a non-trivial class of context-sensitive la...
In order to extend the potential of application of the syntactic approach to pattern recognition, th...
Natural language search from a database makes it possible for non technical users to fetch informati...