Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings
International Conference on Computer Technology and Development, 3rd (ICCTD 2011)
By
Jianhong Zhou
Jianhong Zhou
Search for other works by this author on:
ISBN:
9780791859919
No. of Pages:
2000
Publisher:
ASME Press
Publication date:
2011

In this paper we describe a solution for conversion of direct speech to indirect speech using finite state machine [FSM] parser, which uses skip list as a data structure for syntactic analysis. FSM operates in a bottom up fashion by assuming that the sentence will follow the form identified in the grammar. It looks for words occurring based on the grammar and on reaching the final state a proper sentence for the grammar is identified. Skip list provide the full functionality of a balanced tree where parts of speech are stored in separate nodes that may fail at any time i.e. skip the nodes if not satisfy the grammar rules.

Abstract
Key Words
1 Introduction
2. Algorithm and Data Structure Used for FSM Parser
3 Declarative Sentence
4 Interrogative Sentence
5. Conversion
6. Summaries
References
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal