Sciweavers

163 search results - page 10 / 33
» Sorting Texts by Readability
Sort
View
94
Voted
SPIRE
2009
Springer
15 years 4 months ago
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting
To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous ...
Daisuke Okanohara, Kunihiko Sadakane
ENGL
2006
157views more  ENGL 2006»
14 years 10 months ago
Dealing with Acronyms in Biomedical Texts
Recently, there has been a growth in the amount of machine readable information pertaining to the biomedical field. With this growth comes a desire to be able to extract informati...
David B. Bracewell, Fuji Ren, Shingo Kuroiwa
70
Voted
CSLP
2004
Springer
15 years 3 months ago
Parsing Unrestricted German Text with Defeasible Constraints
We present a parser for German that achieves a competitive accuracy on unrestricted input while maintaining a coverage of 100%. By writing well-formedness rules as declarative, def...
Kilian A. Foth, Michael Daum, Wolfgang Menzel
AMAST
2006
Springer
15 years 4 days ago
DO-Casl: An Observer-Based Casl Extension for Dynamic Specifications
We present DO-Casl, a new member of the CASL family of specification languages. It is an extension of Casl-Ltl and it supports a methodology for conveniently writing loose specific...
Matteo Dell'Amico, Maura Cerioli
BCSHCI
2008
14 years 11 months ago
Designing for people who do not read easily
Many people do not read easily for all sorts of reasons: social and cultural, because of impairments, or because of their context. Even in the area of impairments, design for peop...
Caroline Jarrett, Katie Grant, B. L. William Wong,...