Formal SignWriting
draft-slevinski-formal-signwriting-01

Document Type Active Internet-Draft (individual)
Last updated 2016-12-22
Replaces draft-slevinski-signwriting-text
Stream (None)
Intended RFC status (None)
Formats plain text xml pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
Sutton-Slevinski Collaboration                              S. Slevinski
Internet-Draft                        Center for Sutton Movement Writing
Intended status: Informational                         December 22, 2016
Expires: June 25, 2017

                           Formal SignWriting
                 draft-slevinski-formal-signwriting-01

Abstract

   Sutton SignWriting is the universal and complete solution for written
   sign language.  It has been applied by a wide and deep international
   community of sign language users.  Sutton SignWriting is an
   international standard for writing sign languages by hand or with
   computers.  From education to research, from entertainment to
   religion, SignWriting has proven useful because people are using it
   to write signed languages.

   Formal SignWriting (FSW) is a faithful character-encoding of Sutton
   SignWriting based on 2-dimensional mathematics.  FSW defines a formal
   language for written sign languages where any sign of any sign
   language can be written as a string of ASCII characters.  The
   mathematical names are explained with tokens and regular expression
   patterns.  Symbol keys reference the Sutton SignWriting Symbols.
   Cartesian coordinates are used for 2-dimensional placement.  Signs
   are written in a spatial SignBox, where each symbol is positioned
   with a 2-dimension coordinate.  For sorting, each sign can have an
   optional temporal sequence of symbols that is outside of the SignBox.
   To create sentences, signs are written sequentially, interspersed
   with punctuation symbols.

   The styling string of Formal SignWriting uses a lite markup to define
   a variety of styling options.  The entire sign can be customized for
   padding, coloring, and size.  Individual symbols within a sign can be
   customized for coloring and size.  For SVG, class names and IDs can
   be defined.

   The query language of Formal SignWriting uses a lite markup, similar
   to FSW, to define a variety of searching possibilities.  The spatial
   SignBox can be searched for symbols or ranges of symbols.  For each
   symbol or range, the search can specify if the symbol only needs to
   be found somewhere in the SignBox, or if the symbol needs to be found
   near certain coordinates.  The temporal sequence can be searched for
   starting symbols, written as a sequential list of symbols and ranges
   of symbols.  When searching the temporal sequence, the search results
   will be limited to signs that start with a matching temporal
   sequence.  Each query string is transformed into one or more regular

Slevinski                 Expires June 25, 2017                 [Page 1]
Internet-Draft                     FSW                     December 2016

   expressions.  The regular expressions are used to quickly search
   large amounts of data.

   Formal SignWriting has been specifically designed to integrate with
   standard browser technology.  Four main components make this
   integration possible: 1) Font Technology, 2) Scalar Vector Graphics,
   3) HTML and CSS, and 4) a JavaScript Library.

   Formal SignWriting is ASCII based, so it is compatible with and
   optimized for UTF-8.  Using the 672 existing characters of the Sutton
   SignWriting block in Unicode 8 along with an additional 17 proposed
   Unicode characters, it is possible to create a pure Unicode string
   that is isomorphic to the Formal SignWriting string.

   This memo defines a conceptual character encoding map for the
   Internet community.  It is published for reference, examination,
   implementation, and evaluation.  Distribution of this memo is
   unlimited.

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at http://datatracker.ietf.org/drafts/current/.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on June 25, 2017.

Copyright Notice

   Copyright (c) 2016 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (http://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
Show full document text