From mboxrd@z Thu Jan 1 00:00:00 1970 Path: main.gmane.org!not-for-mail From: googleartist@yahoo.com (Artist) Newsgroups: gmane.emacs.help Subject: Re: Word Completion by Association Date: 3 Mar 2003 18:36:55 -0800 Organization: http://groups.google.com/ Sender: help-gnu-emacs-bounces+gnu-help-gnu-emacs=m.gmane.org@gnu.org Message-ID: References: NNTP-Posting-Host: main.gmane.org Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 8bit X-Trace: main.gmane.org 1046745777 18540 80.91.224.249 (4 Mar 2003 02:42:57 GMT) X-Complaints-To: usenet@main.gmane.org NNTP-Posting-Date: Tue, 4 Mar 2003 02:42:57 +0000 (UTC) Original-X-From: help-gnu-emacs-bounces+gnu-help-gnu-emacs=m.gmane.org@gnu.org Tue Mar 04 03:42:56 2003 Return-path: Original-Received: from monty-python.gnu.org ([199.232.76.173]) by main.gmane.org with esmtp (Exim 3.35 #1 (Debian)) id 18q2OO-0004os-00 for ; Tue, 04 Mar 2003 03:42:56 +0100 Original-Received: from localhost ([127.0.0.1] helo=monty-python.gnu.org) by monty-python.gnu.org with esmtp (Exim 4.10.13) id 18q2Md-0000F9-02 for gnu-help-gnu-emacs@m.gmane.org; Mon, 03 Mar 2003 21:41:07 -0500 Original-Path: shelby.stanford.edu!newsfeed.stanford.edu!postnews1.google.com!not-for-mail Original-Newsgroups: gnu.emacs.help Original-Lines: 60 Original-NNTP-Posting-Host: 68.37.117.130 Original-X-Trace: posting.google.com 1046745415 18844 127.0.0.1 (4 Mar 2003 02:36:55 GMT) Original-X-Complaints-To: groups-abuse@google.com Original-NNTP-Posting-Date: 4 Mar 2003 02:36:55 GMT Original-Xref: shelby.stanford.edu gnu.emacs.help:110774 Original-To: help-gnu-emacs@gnu.org X-BeenThere: help-gnu-emacs@gnu.org X-Mailman-Version: 2.1b5 Precedence: list List-Id: Users list for the GNU Emacs text editor List-Help: List-Post: List-Subscribe: , List-Archive: List-Unsubscribe: , Errors-To: help-gnu-emacs-bounces+gnu-help-gnu-emacs=m.gmane.org@gnu.org Xref: main.gmane.org gmane.emacs.help:7275 X-Report-Spam: http://spam.gmane.org/gmane.emacs.help:7275 Le Wang wrote in message news:... > Artist wrote: > > > Hi I am looking for mechanism which allows me to complete the word > > based on association. Example: I have only 4 words : [artist], > > [google], [emacs], [gnu] > > > > then the 'representations' r , o, m, u should be enough to complete > > the above words respectively. Now lets say that we add the word > > [glass] in my set. Then 'glass' can be represented by 'l' and if we > > add the word [late] it could be represented by 'lt'. It's like > > shorthand for emacs or 'auto abbreviation'. > > > > The key is that emacs automatically defines the abbreviations and let > > us know. > > > > Is it already possible? difficult? possible at all? > > Your questions are nothing if not interesting. ;) > > Have you given any thought as to how you would implement such a completion > system. > > Currently substring completion is possible and it does most of what you ask > for. See icomplete, mcomplete. Hi, You may call this method: Auto Abbreviation in a buffer. When I type the text in buffer, it should automagically note each word and figure out different combination of it, and make combination index which when typed in buffer again should result in uniq word. ex.. If I type: ---------- This is emacs It should create an index file in such a way that when I type 'T' or 'h' and hit some completion command it should complete with 'This'. My word: Completion Word Ti This hi This ts This em emacs mc emacs is is go go es emacs Thus I need to recall minimum letter of what I typed earlier. This is much like iswitchb interface with the addition that you can type any combination of letters, not necessarily sequentially. When I add more words, above table will change on fly or with some command I dont' know about mcomplete, but icomplete mode is not enough for this. Hope that would clarify. Artist