The Logical Language Group Online Dictionary Query

There are specific tools that make searching this database easier:

la sutysisku dictionary, an offline enabled web app

la vlasisku search engine for the Lojban dictionary

Query string:
Search type:
Database:

Database copyright information
Server information

To improve the quality of results, jbovlaste search does not return words with insufficient votes. To qualify to be returned in search results, a proposed lujvo is required to have received a vote in favor in both directions: for instance, in English to Lojban and in Lojban to English.

In addition, due to it being a very technically hard problem, full text searching (that is, searching of definitions rather than just keywords) is not available at this time.


1 definition found
From Lojban to English :

        Word: tcanapu [jbovlaste]
        Type: fu'ivla
  Gloss Word: backward in graph
  Gloss Word: backward in network
  Definition: x1 (node/vertex/station) is backward of/along from x2 in
       oriented graph x3 (graph with orientation) using oriented edge
       path x4 (ordered sequence of ordered pairs; oriented edges).
       The path from x2 to x1 along the (now-unoriented version of
       the) edges used in x4 is counter/against/upstream of the
       orientation of x3 (and/or given by the oriented version of x4).
       Notes: Orientation is given from/by x3, so only an edge need be
       submitted if x3 is fully specified; if x3 is not fully
       specified, x4 can take the burden of specifying the orientation
       and subgraph of particular interest (namely, the two vertices
       x1 and x2, intervening vertices along the path, and the
       orientation of the given edges connecting them). Note that on
       an unoriented edge or along a cycle, x1 and x2 might be able to
       exchange places and/or be equal one another. x4 is an ordered
       sequence of ordered pairs; the first entry of each pair is the
       origin node, the second pair is the destination node; the path
       should probably be connected (so that the destination node of
       one pair is the origin node of the next, except possibly if it
       is the last such pair). x1 is not necessarily last (id est:
       backward adjacent of/from) x2, but it can be. Useful for pages,
       webpages, family relationships, utterances, etc. See also:
       grafu, tcanaba, tcanaca

Questions or comments about this site? Contact [email protected]