Q2. What are the future works mentioned in the paper "A formal framework for linguistic annotation" ?
More complex modes of interaction are also possible, as are connections to other sorts of databases ; the authors regard this as a fruitful area for further research.
Q3. What are the possibilities of gaps and overlaps?
Gaps might correspond to periods of silence, or to periods in between the salient events, or to periods which have yet to be annotated.
Q4. What is the tipter architecture for linguistic annotation of text?
The Tipster Architecture for linguistic annotation of text [19] is based on the concept of a fundamental, immutable textual foundation, with all annotations expressed in terms of byte offsets into this text.
Q5. What is the way to define annotation graphs?
Based on the formal precedent of SGML, the model of how chart-like data structures are actually used in parsing, and the practical precedents of databases like TIMIT, it is tempting to consider adding a sort of grammar over arc labels as part of the formal definition of annotation graphs.
Q6. What is the common way to break an annotation graph into chunks?
The authors will usually need to break an annotation graph into chunks which can be presented line-by-line (much like interlinear text) in order to fit on a screen or a page.
Q7. What is the purpose of the definition of anchored annotation graphs?
For the sake of a clean algebraic semantics for the query language, the authors will permit queries and the results of queries to be (sets of) arbitrary annotation graphs.
Q8. What is the direct way to treat time references?
The most direct way would be to treat Tipster byte offsets exactly as analogous to time references – since the only formal requirement on their time references is that they can be ordered.
Q9. What is the main problem with existing tools and formats?
While the utility of existing tools, formats and databases is unquestionable, their sheer variety – and the lack of standards able to mediate among them – is becoming a critical problem.