text:
I Love the DMV
It seems that with modern technology and all it can do for us, we have been able to move on from the regular mundane tasks that we used to consider a way of life. One of those tasks for me was the annual trip to the DMV. But now, with online registration and electronic submittal of smog certifications, there really isn't a need to actually go stand in line any longer...or so I thought. Yesterday, I spent four hours either standing in line or sitting on the sidewalk saving my place beside someone who is probably the most interesting person I've ever come in contact with. She definitely ranks in my top five.
This post isn't really about the DMV or why I had to take half my day to go there, nor is it about the person I met and her reason for being there. We both had out of the ordinary situations; I realize now how lucky I am to have had a reason to be there. This post is a reminder that we never know what, or who, may be put in our paths. We can only be so lucky that it may be someone or something that speaks to us on a level we never knew was there.
When I first arrived at the DMV I noticed the line snaked around the side of the building. I braced myself for a long wait. Luckily I had book in hand and knew that I would get a good bit of time to read, interrupted only by the automated voice over the loud speaker calling out the next number in line. I can remember being thankful that I was reading an actual book and not one on my iPad as I was outside and the glare from the life-giving (and searingly hot) sun would have definitely made it difficult to continue. The lady standing next to me commented on her love of reading and reluctance to embrace new technology. She was excited to find another bibliophile who preferred a print version over an electronic version of a great book. Boy am I glad I didn't bring my iPad! I didn't have the heart to tell her that I love technology and work with gadgets, programs and devices all day long. I just smiled and nodded in agreement and asked her what she was reading at home. From that moment I hung on her every word. I was so afraid the line would advance to the point where we would go our separate ways.
Our conversation shifted from the books we were reading to the places we grew up. We noticed there were some people standing in line very politely, against the building, making sure the newcomers had a means to pass on the sidewalk. We also noticed others who were so enthralled with whatever was on their smart phones that folks either had to walk on the hill below the sidewalk to take their spot in line, or wait and ask the person to move aside. The offender on the phone would usually look irritated that they had been interrupted. Those reactions irritated my new friend and me. The woman I had met, I need to give her a name now ~ I think it will be Ann (I'm so sad we didn't get each other's names), said you can tell where a person was raised by how they act in crowded situations. She said she was a mountain woman and that she was raised to always be looking for others who needed help. I told her I was a mountain woman, too, or at least I was raised in the mountains. She said she could tell. I liked that.
It turns out Ann was from the Central California mountains but had moved to the San Diego mountains ten years ago. That just happens to be when we moved to San Diego as well. She said she had been a truck driver for over 30 years and she had spent a great deal of time in the North Carolina mountains where I grew up. She knew almost every detail of everywhere our family had ever lived. We talked about my husband being in the Navy and us having lived all over the country. She was a very patriotic seeming person and made sure to tell me to thank my husband for his service. She said she loved the life of a truck driver. She worked for herself as she had her own rig. She took jobs she felt good about and truly felt she was providing a service to the public by helping to transport needed goods from point A to point B. She told me she was retired now, but still provides transport of horses in her trailers and pick-up. I got the sense from her that she felt passionately about everything she did. She had a deep love of animals and their well being ~ another topic we had in common.
She told me about her granddaughter and daughter who were visiting and all the fun they had had. She had taken her granddaughter out kayaking and hiking. She later worked into the conversation that she was in her late sixties. I couldn't believe it. Yes, she had the face of someone who had worked hard and spent a lot of time outdoors, but I would have never believed she was a day over 55 or so. The wrinkles on her face were like a road map of her life experiences, with each wrinkle being brought on by another smile or belly laugh that comes up from the toes. She was dressed in shorts and a polo shirt with a ranchers vest over her shirt. It was her shoes, though, or should I say boots, that I loved most. They were a very expensive brand of working boots. You could tell they were her favorite shoes by how worn they were. I was sure she wore them because as soon as she returned from the DMV, should would be starting her feeding rounds of all the horses and farm animals she takes care of on not only her ranch and farm, but those of her neighbors. She said it takes her about 2.5 hours each day just to do the last feeding. She was amazing. I asked her how she kept up with everything and how she had the energy to do all she was doing. She told me that the secret to good health and lasting energy is humor. She said everyone needs to learn to laugh every day, all day long. She then started to tell me how she had used humor as a treatment to save her life.
It turns out that Ann was a cancer survivor. She had had 27 surgical procedures and four rounds of chemotherapy. Her first bought with Melanoma Carcinoma and chemotherapy was back in 1989. She had three subsequent chemo treatments in 1994, 1998 and 2004. Each time her doctors were giving her a very grim outlook and preparing her and her family for the worst, expecting her to be gone within the year. She said she became her own medical advocate and that her number one treatment was laughter. She had always been a positive person and someone who loved comedy. She began to watch videos, read books, listen to audiotapes of all the famous comedians and of the the funniest shows she could remember. She would go to comedy shows and improv nights wherever and whenever she could. She said she knew she had had a good day if she could laugh until she cried. She stayed positive throughout and changed her diet long before good clean eating was trendy or even prescribed for good health.
She admitted that her personality is a little brash and that she could definitely be a pest in the medical scene with her doctors. She was misdiagnosed numerous times when she knew she was having a recurrence of the disease. She kept fighting though and changed doctors numerous times to get the help and diagnosis she knew was right for her. In all her 27 procedures, only two of them proved to be unneeded. I figure she saved her life numerous times. I looked at her in amazement. She must get that look lots because she acknowledged it by laughing and saying that there must be some crazy reason why she's still around. She said she hopes she can be an example to others. She also told me about all the volunteer work she does at the John Wayne Cancer Society. She leads classes on....you guessed it, Humor Therapy!
As our time in line was nearing an end, she told me a bit about her life in retirement. She has horses of her own and cares for two other ranches. She has goats and chickens ~ I was very excited to hear this as we are hoping to do the same some day. She talked about how her dream of having an organic garden has come true now that she doesn't have to do trucking runs any longer. She said that she grows enough organic produce to feed her entire community. She has started a garden co-op as well as a dairy co-op with her goats' milk and eggs. She educates all those around her on the benefits of eating organically. She is my dream person and I want to be just like Ann some day! She even makes her own cheeses, lotions and soaps!
We ended our time wishing each other well. She told me I needed to stress less and laugh more and asked me what my health condition was. She could tell. I'm not sure how...maybe all of us that have gone through health issues are somewhat intuitive. Or, maybe Ann truly has a gift for reaching out to others and knowing their needs even when they don't know their own. I told her about my Multiple Sclerosis diagnosis and that I was doing fairly well. I told her about my shift to eating only organic foods and how that's made an improvement on my everyday health and slowed the progression of the MS. I also told her that I love to laugh and plan to do much more of it in the future, thanks to her great advice. She was happy to hear that and then gave me a big hug.
To Ann ~ With Love, From Alison


text: Hey guys, I have read on TMC regarding evercharge setting up charging stations in condo/apt parking. I have been in contact with a representative at evercharge and he said the prices range from $2500 to $4500 to set it up and $15/month + usage. I was wondering if you guys think this price is reasonable? Also if you guys have used any other third party firms that you would recommend? And any reviews of evercharge would be helpful too! The condo that I am thinking about setting up is 77 Hudson in Jersey City, NJ.

subset: commoncrawl


text:
Maximize your efficiency by repairing equipment to peak operating condition. Mid Columbia service department is designed explicitly to service the requirements of lift trucks and material handling equipment while repairing your equipment to peak operating equipment. Our facility is fully equipped to maximize your productivity with our overhead cranes and efficient layout of parts, service rental and sales areas.
Contact our service department today to discuss your service options.


text:
Kevin Levrone Signature Series Levro Lean 90 capsWritten on 03/04/2017 – 14:08 | by admin |
Powerful Fat Burning Supplement from The Kevin Levrone Signature Series. If youre in search of a lean, toned and sculpted physique then LevroLEAN is the supplement for you.
Blended from carefully chosen bioactive substances LevroLEAN has been crafted from ingredients which assist in the reduction of body fat mass by speeding up metabolism.
LevroLEANis derived from the extracts of:
Cocoa seeds can offer significant contribution to your bodies fat burning capability, enhancing metabolism and aiding healthy weight loss.
Green tea leaves also provide support to our metabolism to help with weight loss, whilst providing valuable anti-oxidation properties. In addition they also assist our skins protection against UV rays while helping maintain healthy blood glucose levels and strong bones.
Guarana seeds provide further help to healthy weight control through supporting our bodies fat metabolism.
Cayenne pepper has been included for its known benefits in helping the body reduce fat and speed up metabolic processes.
Bitter orange (Synephrine) provides effective support for the metabolism of lipids and carbohydrates, further enhancing the reduction of body fat and helping with healthy control of our bodys weight.
Price: £19.99 from Affordable Supplements


text:
Marko Marin says he wants to prove that he is good enough to play for Chelsea, after the club confirmed a deal with the playmaker in April.
The Blues made a risky move signing Marin three months ago, with the 23 year old still yet to live up to the hype that he will be one of Germany's top players.
And with criticism reaching higher heights as the star was left out of the international side when they travelled to Euro 2012, Marin is keen to prove he is worth the gamble at Chelsea next season.
"There has been some criticism for me to deal with in the last couple of years and that is all part of growing up in this game, but I'm ready to prove I can be good enough to play at Chelsea," Marin told ESPN.
"People can say what they want about me being lightweight and it has been said a lot in recent times, but all that matters to me is improving as a player and I believe I can make it here.
"All professionals have the burning desire to play and I'm no different, but I need to raise my level of professionalism and to perform better than ever to make an impression at this club. Everything I have seen at Chelsea is a step up from what I have been used to, but this is a good thing for me."
For Marin, competition will be a lot higher for his place at Chelsea than it was at Borussia Monchengladbach, particularly with the club purchasing Eden Hazard this summer as well.
But the star is ready to show that he is up for the challenge, and wants to prove his critics wrong.
"Chelsea have a squad with alternatives for every position and you just have to live with that sort of competition," he explained. "I know I will have to prove myself at every turn, but it's also fair to say that Chelsea bought me to play me.
"I spoke with the manager and he assured me that I was a big part of his plans.
"Some people in Germany doubt whether I can make a success of this move to such a big club, but I have faith in my abilities and have not come here to be a failure."


text:
Vale Robin Sharwood
The Melbourne Law School community is deeply saddened to hear of the death of Professor Robin Sharwood AM on Sunday, 12 April. He was 83.
Professor Robin Sharwood AM (fifth from left) pictured with former classmates in 2007
Prof Sharwood's involvement with MLS dates back more six decades, having graduated with an LLB (Hons) in 1954, winning the Supreme Court Prize.
He was also a Senior Lecturer from 1958-1962 and returned to teach at the Law School in 1980, being made a Professorial Associate and Fellow in 1989.
MLS Dean Professor Carolyn Evans said few people had made such a significant contribution to MLS over such an extensive period of time as Prof Sharwood.
"Professor Sharwood was a dear member of the Melbourne Law School community. His tremendous contribution to the Law School, characterised by his strong intellect, generosity of spirit and collegiality leaves a lasting legacy in the history of Melbourne Law School and its community," she said.
"Robin was a truly gifted teacher whose students remember his lectures with admiration and warmth. His knowledge of legal history was extraordinary and his lectures are remembered by generations of students as among the finest they attended. He combined a deep knowledge of his subject with an elegant communication style and a dry wit."
"Professor Sharwood had a strong friendship with the late Sir Zelman Cowen, a former Dean of the Law School, and one of the highlights is the fitting tribute he paid to this leading figure of MLS at the Sir Zelman Cowan Public Lecture held at the Law School in 2014," Professor Evans said.
"At this time, it is apt to reference a quotation from Shakespeare's Hamlet which Professor Sharwood used to describe his friend, but which is testament to both men as leading figures of the Law School and broader community:
'He was a man, take him all in all.
I shall not look upon his like again.'"
Prof Sharwood was educated at Mont Albert Central School and Wesley College before completing his Bachelor of Arts (1953) at the University of Melbourne.
After completing his LLB, Prof Sharwood served articles of clerkship with Norris, Coates and Hearle, and was admitted to practise in 1955.
He was then appointed the Walter Perry Johnson Graduate Research Fellow at the University of California, Berkeley, where he obtained his LLM the following year.
He returned to Australia two years later to take up positions with MLS and Ormond College before he was appointed Chair in Law at the Australian National University.
In 1965, he became Warden of Trinity College, a position he held until 1973, and later worked at the Victorian Law Foundation before his return to MLS.
Prof Sharwood was also Lay Canon of St Paul's Cathedral for almost 35 years, as well as Chancellor of the Anglican Church to the Dioceses of Wangaratta (1974-99) and Ballarat (1995-2002), advising on matters of Ecclesiastical Law, a specialty in which he practised pro bono for more than three decades.
He was also involved in the Arts Council of Australia, Australian Broadcasting Commission, Royal Botanic Gardens Melbourne Trust Fund, and Friends of the Gallery Library of the National Gallery of Victoria.
On Australia Day in 2000, he was appointed a Member of the Order for Australia for service to legal education and for service to the Anglican Church of Australia.
His funeral service will be held at St Paul's Anglican Cathedral, corner of Swanston and Flinders Streets, Melbourne at 3pm on Wednesday, 22 April.
By Andy Walsh


text:
This Sunday, Dublin Sketchers are meeting at the National Gallery of Ireland, Merion Square, Dublin 2.
Large parts of the National Gallery have been off limits for several years due to extensive renovations … and have been sorely missed by Dublin Sketchers. The Gallery has now fully re-opened and we're looking forward to reacquainting ourselves with its many treasures.
As usual we will begin 2pm. Since it's mid-summer, we'll suggest two options for coffee at 4pm, one indoor and one outdoor.
Option One: The Gallery Café (grab the big table in the middle if you can)
Option Two: Get a take-away coffee from Insomnia (Lincoln Place) and gather beside the cricket field in Trinity College.
Keep an eye on WhatsApp to see what we decide. (If you'd like to join our WhatsApp Group, just reply to this email with your phone number and we'll add you.)
If you haven't been before, keep your eyes open for anyone carrying a sketchbook and come and say hello. Don't worry if you're late, lots of us usually are.
Dublin Sketcher's is FREE – just bring your own drawing materials.
Hope to see you there!


text:
Monday, May 2, 2011
Quick POst
Ever since Trad Home popped up in the Sphere I was pleasantly reminded of this here Fellas work.... ain't it purty? I love how he can just throw a room together and make it look so relaxed and casually chic.
7 comments:
- AnonymousMay 2, 2011 at 9:56 AM
Thanks for the quick post. Loved seeing all the pics. Lovely interiors are always fun to see. :) Have a great day!ReplyDelete
Love him! Especially that he doesn't have your typical designer background. I'd say the two of you share some style DNA, no?ReplyDelete
Every picture is this post is the style I love- a mix of classic and modern, traditional and uptown chic!ReplyDelete
Love his ability to mix and have it all look effortlessly chic- gorgeous.ReplyDelete
The perfect combination of a multitude of styles. Beautiful images!ReplyDelete
love you blog, I would love to know the floors you used in your house...brand and wood etc.ReplyDelete
He has perfected that "un-decorated" look....ReplyDelete
Subscribe to: Post Comments (Atom)


text:
Grand Format
Make a BIG impression. From signs to banners, vehicle wraps to wall graphics, Corporate Communications Group is perfectly equipped to manage the full range of your large format printing needs.
Hailed as one of the top large format printing resources in the Washington DC area, our team brings decades of experience as we take a consultative, thoughtful approach to each project. Our eye is on the end-game, as we determine not only what your needs are, but also the environment your project will be displayed in.
Withstanding harsh weather is a real challenge for exterior grand format pieces. Our capabilities include printing with advanced ultra-violet inks (humidity, water, temperature, and sunlight resistant), and we feature a full range of substrates and finishing techniques. Installation? No problem! We're a complete turnkey service from design to production to installation. Whether your project entails setting up conference graphics, installing custom wall graphics or signage, wrapping a vehicle or an entire building, our team will manage the details and get it right.
Looking to produce a wide format project with a truly unique shape? Look no further than Corporate Communications Group. Our router capabilities enable us to create truly extraordinary custom finished pieces such as life-size cut-outs, custom-shaped wall graphics, magnets, coasters…practically any shape you can imagine can be fashioned with our large format printing.
Looking to take your ordering process for large format printing online with multiple users? It's a snap at Corporate Communications Group! We'll design a customized web-to-print portal for your organization complete with secure order entry, proof and approval levels order history, costing, tracking, reporting and more. From wide format print products to corporate collateral and personalized digital print, your marketing assets can be at the tip of your fingers wherever you can be online.


text:
Today it is a pleasure to introduce another guest writer, a beraved mom, who has been willing to share the struggles she went through to get back on her feet following the loss of her 35-year-old son Perry. She writes with openness and allows us to enter her struggle through grief and her eventual place where she has found hope.
Please read this article by Judy Walters and be encouraged!
Clara Hinton
Struggling to Get Back On My Feet: Surviving the Death of My Son
In 2006 my youngest son died. He was 35 years old. It was, and still is, the worst thing I have ever experienced. I'm no different than any other parent who loses a child. We all struggle to go on. We mourn in different ways. Some parents survive and some don't. There were many days I didn't know if I would or if I even wanted to. Perry never married and had no children. He did have 3 dogs that I had already taken under my care when he was no longer able to due to his alcoholism. I have another son 3 years older than Perry who did have a wife and children. I felt like I needed to live for them.
I was very involved in dog and cat rescue in my area before Perry's death. I had Perry's dogs, my dogs and numerous foster dogs when he died. They gave me a reason to drag myself out of bed each day. Once they were taken care of I dragged myself back to bed until it was time to feed them again in the evening. After a few days I realized that my husband had gone into hiding only to check on me occasionally. He seemed to be afraid of me, of my pain. Perry was his step-son. They were never close so his mourning and adjusting was different than mine.
Everyone seemed to be afraid of my pain and stayed away except my other son who was suffering the loss of his only sibling. He has been so good to his dad and me over the years. Always checking on us and allowing us to share our feelings and cry if we needed to. Since my husband was unable to hold, nurture and comfort me I reached out to the dogs and cats to be by my side day and night. They would snuggle around me on the bed and lay quietly all day and all night getting up only when it was time to eat and go out to potty. As soon as I got back in the bed they were there again licking the tears off my face and giving me all the support they could. It really helped and I think they were a big part in my survival.
Once I got enough strength back to get out of the house it was only for vet visits and to make trips to put the adopted foster dogs on transports to their new homes. When I'd return home I'd drop into the bed exhausted. Since the need to foster and care for homeless dogs and cats is so great I began to pour every bit of strength into taking on more foster dogs. They consumed all my time and energy. Many times I'd cry as I cleaned a kennel or did other chores related to taking care of lots of animals.
As long as I was busy tending to the needs of the animals it appeared that I was okay to the outside world but I was not okay inside. I never attended any grief recovery counseling or groups. I knew I was putting off the mourning that I needed to do but I was not ready to face it – not yet.
Finally 5 years after Perry's death I collapsed. I had a complete mental and physical breakdown. I had pushed myself as far as I could. I had to give up my rescue work and put the focus on getting my health and sanity back.
I didn't know at the time what was wrong with me. Maybe the flu, Lyme's disease? The doctors I went to did tests that all came back negative. I hurt all over like the flu and I was so weak and faint that I was hardly able to walk. My head hurt constantly. My brain was very foggy, unable to concentrate on anything, my memory was awful. I was unable to sleep more than 1-2 hours.
Finally after months of being in bed and seeing several doctors I was referred to an acupuncturist. He gave me IV nutrients and acupuncture. He also helped me find a natural supplement that helped me sleep. I am one of those difficult patients who refuse drugs so I was a real challenge for regular doctors.
After the acupuncturist did all he could for me and I was better I began to see other doctors, 10 in all. Each found something they could treat and then I'd be referred on to the next one. Finally after 1 1/2 years of being sick I decided that I needed some grief/stress counseling so I found a really good counselor who had lots of experience in the areas that I needed support.
What a nice, patient, understanding man he has been. Not rushing me in any area, listening to me vent where I needed to vent and cry where I needed to cry. Always giving me the support that I needed. Week after week he let me talk. He assured me it was okay to cry as much as I needed to cry. That was a good thing because I had buckets of tears to shed.
After a few weeks he began hypnotherapy to help me learn to calm myself and relax. My biggest medical problem was high cortisol due to stress. There is no treatment except stress reduction so it was up to me and this counselor to teach my mind, heart, and body to stop producing adrenalin at crisis levels so my cortisol didn't destroy my internal organs.
I also discovered guided mediation on YouTube that is very helpful for daily practice. Everything I have done has helped. My progress has been slow but I continue to get stronger and my depression is lifting. I'm sleeping better without any sleep aides. I've had to give up my rescue work due to stress but I still have three special needs dogs and two special needs cats that I will keep with me. They need me and I need them. Maybe one day I'll be strong enough to foster one dog or cat at a time. I hope.
Today is the7th anniversary of Perry's death. It is a sad day, but tomorrow will be better.<span style="font-family: Times New Roman
If you are interested in a workshop or Clara coming to speak to your group, please email Clara at: firstname.lastname@example.com. Every attempt will be made to get back to you within two business days.


text:
HP M553dn Drivers Download
HP M553dn Drivers Download / Software
HP M553dn Drivers Download
The HP Shade LaserJet Enterprise M553dn is actually an outstanding selection for high-volume publishing because of its good printing quality and prompt rates. That likewise possesses respectable assistance for mobile publishing and the lowest per-page expense of any kind of color laser printer in our testimonial.
The HP Different colors LaserJet Venture M553dn is a different colors laser printer designed for the office and also constructed with high-volume printing in mind. This flaunts large-capacity newspaper racks, an outstanding 80,000-page task pattern and also the most affordable per-page cost of publishing for a color printer in our customer review. The Shade LaserJet M553dn additionally keeps that simple-- its own style focuses on printing just, without the included complication of a scanning device or facsimile.
The printer's 2.2-inch different colors LCD display is considerably smaller compared to those on other color printers. Additionally, the lack of touch support means you need to punch buttons to change settings or even pattern with function menus.
The premium from the papers that imprinted in our tests performed par with the greatest colour laser printers our team assessed. There were few inaccuracies in the text-heavy examination documentations, though there were some troubles with shade in various other exams-- in our Excel examination, lines set against a history slope possessed some unnecessary different colors switching, as well as there was some incline tipping, apparent different colors changes that must lie as well as unnoticeable, in our PowerPoint test. The device published both black and white and colour web pages at a fee from 19 webpages every minute, which is actually much better in comparison to average. As a single-function ink-jet printer, the HP Different colors LaserJet has no scan and also duplicate functionality.
One more region where this printer stands out is working expenses-- it makes the most budget friendly shade prints in our testimonial. When you make use of standard-capacity containers, the expense malfunction to 15 pennies each page. High-capacity containers fall the cost of cartridge and toner to 11 pennies per page, making it the best efficient option of any kind of shade printer.
With a primary paper tray that holds up to ONE HUNDRED web pages and a subsequent tray along with a 550-page ability, this is one of the largest-capacity dual-tray printer offered.
The ink-jet printer is equipped along with both Ethernet as well as Wi-Fi for networking, yet without a lot USB port, you cannot standalone print from external storing. Howevered, the equipment assists Apple AirPrint, so that needs to play beautifully along with your Apple smart device and tablet, and also near-field interaction (NFC) lets you wirelessly partner any type of NFC-equipped tool with merely a touch. If you want to do over merely printing from your phone, you can easily make use of the HP ePrint app to publish straight from other apps, social networking sites services as well as cloud storing.
HP covers the Colour LaserJet Enterprise M553dn with a typical 1 year service warranty and also uses individually help through email, phone and reside conversation on its website. On the web assistance component is plentiful, with individual handbooks, repairing manuals, FAQs and client support forums.
The HP Shade LaserJet Business M553dn incorporates solid print quality along with the best economical publishing costs of any shade laser printer in our review. This may be actually as well expensive to call it the greatest finances printer, however that is actually an excellent choice for anyone trying to publish high volumes from documentations in different colors.
HP Color LaserJet Enterprise M553dn Drivers
- HP Easy Start 18.104.22.168 / Jun 14, 2017 Support Mac: Download
- FutureSmart Bundle Version 188.8.131.52 Firmware (Includes Code Signing) for - All OS - (Must Read README Before Installing): Download
- Full Software and PCL 6 Driver 14.0.16124.472 for Windows 7/8/Windows 8.1/Windows 10 (32/64-bit): Download


text:
Method and apparatus for improved multi-tap text input
The defacto standard for text entry on standard telephone keypads, such as fixed phones, cell phones, fax machines, and the like is a multi-tap method where one of several letters associated to a input means is selected by pressing the input means a number of times equal to the position of the desired letter in the ordering of letters associated to the input means. Typically, for the standard alphabetic ordering, a large number of presses are required to obtain any given letter. The present invention uses prefix information to dynamically reorder the choices so that the average number of input means manipulations is reduced. This method is applicable to any language composed of strings of symbols for which the probability of any given symbol appearing in a string at a given position is correlated with the probability of another symbol appearing in the string. Using adapted data compression techniques, the amount of information which needs to be stored for excellent results on any given language can be kept small.
This application claims the benefit of provisional application entitled "Touch-Typable Devices Based on Ambiguous Codes and methods to Design Such Devices," filed Dec. 10, 1998, bearing the Ser. No. 60/111,665, the contents of which are relied upon and incorporated by reference.
This invention relates to text-input technology as used in keyboards in which a plurality of symbols may be associated to each of a plurality of input means. More particularly, it relates to an improved multi-tap method of utility for text input on communication equipment in which the number of input means devoted to symbol input is less than the number of symbols potentially input, such as a standard telephone keypad.
On the standard telephone keypad letters of the alphabet are associated in groups to keys, and presented in alphabetic order. The key associated to the number 2 is also associated to the letters a,b, and c, the key associated to the number 3 is also associated to the letters d,e, and f, and so on. On cellular telephones, designed to be used in any of a variety of languages, the same keys may be selectably associated to a group of letters and accented letters appropriate to the language. For example, for a phone designed to be used in French, the key associated to the number 2 maybe also be associated to the letters a,b, and c, as well as the accented letters à and á, and also the letter c. The standard method for accessing these letters is to tap the key a number of times equal to the position of the desired letter in some standard ordering. For example, if the ordering in the example above is a,b,c,à,á,c, then the user must tap the corresponding key 6 times to access the letter c. Thus the method is referred to as a multi-tap method. This method has the advantage of being simple to learn, of predictable behavior, and requiring software and hardware of minimal complexity to implement, and these advantages have lead to wide-spread acceptance of this method. However, the method has the disadvantage of requiring more than one keystroke on average to type most texts, and for certain symbols at least, may require a large number of taps per symbol. Most users find these large numbers of keystrokes a burden to perform, and any method which reduces the number of keystrokes is thus of great utility. The present invention teaches such a method, which preserves the advantages of the prior-art multi-tap method of being simple to learn, and requiring minimal software and hardware. It has slightly less predictable behavior than the standard multi-tap method, but this drawback is largely compensated for by the vastly reduced number of keystrokes. This method is generally applicable to any language in which strings of symbols in the language are not typically random, this includes for instance all written natural languages, as well as computer languages, and most synthetic, man-made languages, such as Esperanto and Klingon.
The essential aspect of the invention is to present the letters associated to each input means in the order in which they are most likely to be selected by the user. This order can be determined by analysis of the probability of symbols and sequences of symbols in the language. Indeed, a hierarchy of probabilistic data can be collected, permitting increasingly refined estimates of the likelihood of an ordering.
Prior-art methods to reduce the number of keystrokes using word- or block-based predictive text input, such as the methods described in U.S. Pat. No. 5,818,437 or US provisional application number 60/111,665, inevitably result in unstable displays where the letter which should be displayed at the moment a key is pressed can sometimes not be fully and correctly determined. In these cases, a letter is chosen for provisional display, and further information collected from later keystrokes is used to change the provisionally displayed letter. This effect can be disturbing to users and is a departure from the behavior of the well-known multi-tap method. In order to retain the display stability of the multi-tap method, the present invention does not allow information from subsequent keystrokes to result in changes to symbols displayed as the result of previous keystrokes.
It is one of the essential objects of this invention to reduce the average number of keystrokes required to input symbols using a multi-tap method or an apparatus embodying this method.
It is a further object of this invention to provide a method and apparatus which can be used for any written natural language.
It is a further object of this invention to provide a display which is stable in the sense that a displayed symbol does not change unless explicit instructions to change are entered by the user.
It is a further object of this invention to accomplish the object of reducing the number of keystrokes required to input symbols using a multi-tap method using hierarchically organized probability information, whereby the data storage requirements of the method can be scaled to match the data storage capacity of the device implementing the method, making the method and apparatus applicable to with small amounts of data storage capability, such as smart cards.
It is a further object of this invention to provide and store positionally dependent orderings information to reduce the number of keystrokes require on average to input a symbol.
It is a further object of this invention to provide a positional differential method to store orderings information, and thus reduce data storage requirements.
It is a further object of this invention to provide a hierarchical differential method to store orderings information and thus further reduce data storage requirements.
It is a further object of this invention to provide a method to allow a given amount of storage allocated to a database of orderings to be used optimally.
It is a further object of this invention to provide a means to synergistically combine the present improved multi-tap method of text entry with ambiguouscode methods for text entry.
It is a further object of this invention to provide an auxiliary input means for advancing symbols in an ordering, thus removing the need for timing information or a symbol-ending input means used in prior-art methods.
Further objects of this invention will be disclosed in the detailed specifiation to follow.
The following specification will be presented in relationship to a sequence of drawings.
FIG. 1: A schematic drawing of a telephone showing the standard assignment of letters and numbers to keys.
FIG. 2: A flowchart for using the invention.
FIG. 3: An overview of the invention.
FIG. 4: The excess number of keystrokes required to input an example sentence using the prior-art multi-tap method, and two variants of this invention's improved method.
FIG. 5: A graph showing the average number of keystrokes required for 1-4 block position-dependent and position-independent probabilities, for a standard database of probabilities of English words.
FIG. 6: A graph equivalent to that of FIG. 5, for several other languages using a character set which includes the Roman alphabet.
FIG. 7: position dependence of the number of keystrokes, in the prior-art vs. improved multi-tap method.
FIG. 8: Flow chart for using the best-mode storage method.
FIG. 9: Flow chart for construction a database of orderings as used in the best-mode storage method.
FIG. 10: The overview as in FIG. 3, further comprising an auxiliary input means for advancing symbols in an ordering.
FIG. 11: The overview as in FIG. 10, further comprising a predictive text input means, and an auxiliary input means for use in conjunction with the predictive text input means.
It is well known that in a natural language different letters occur with different frequencies. For instance, in the first sentence of this paragraph, the letter "e" appeared 11 times, while the letter "z" did not appear at all. This is also true of pairs of letters, triples of letters, and so on. In particular, the probability that a given letter occurs may be conditional on which letter or blocks of letters precede the given letter. For instance, in English, if the letter "q" appears in a word, it is much more likely to be followed by the letter "u" than by the letters "v" or "t", even though "t" is a priori more probable than "u" or "v". This information can be exploited to improve the multi-tap method as follows. In the prior-art multi-tap method, one press of the "8" key on the telephone keypad is used to input a "t", two presses of the "8" key used to input a "u", and three presses of the "8" key used to input a "v". That is, the three letters corresponding to the key are presented in alphabetic order. In the present method, when 2- or greater block probabilities are used, an immediately previous selection of the letter "q" in a word will cause the letter "u" to be presented first, before "t" or "v", so that only one keystroke is required to input "u", while two would be required for the prior-art method.
That observation supplies one essence of the invention. Another key observation is that the relative probabilities of letters may depend also on the position within a word. For instance, while, in English, the letter "a" is generally more probable than the letter "b", it is more probable that a word begins with the letter "b" than with the letter "a". Thus, in most positions in a word, "a" should be ordered before "b" in an improved multi-tap method, however, in the first position of a word, "b" should be ordered before "a", in order to reduce, on average, the number of keystrokes required to enter a word. It should be noted here, as will be evident to one skilled in the art, that "average number of keystrokes" could be replaced by another convenient statistic, such as "median number of keystrokes", without changing the essential features of this invention. Thus, throughout this specification, average or expected number of keystrokes could be read as average or exected number of keystrokes or other appropriate statistic on the number of keystrokes.
To make use of block probabilities to predict which letter the user will input next, and thus reduce the number of keystrokes required, a large amount of information concerning blocks and their probabilities may need to be stored. However, there is a great deal of consistency across positions in which ordering of letters is optimal. We have noted that while "a" is generally more probable than "b", in the first position "b" is more probable than "a". In a simple approach, one would store, for each possible position, an ordering of "a" with respect to "b". In this simple approach the information stored is highly redundant. Since the ordering at a given position is typically similar to the ordering at an adjacent position, that is, there is significant continuity across positions, a "differential" approach to storage or ordering information is appropriate. That is, rather than store the ordering at each position, one can store an initial ordering, and then encode changes to this ordering as they occur. This reduces the amount of storage required. If a still greater reduction in storage is required, one can choose to limit the amount of change information stored, and only store the most important changes, where the importance of a change is measured by how much the change impacts the average number of keystrokes used to input text.
A final observation is similar to the observation of positional continuity in that large-block probability information can be expressed as corrections to small-block information. That is, while "t" is generally more probable than "u", and thus should be ordered before "u" in order to reduce the average number of keystrokes, in certain circumstances, such as when "q" appears in the immediately previous position, "u" is more probable than "t". Thus, rather than store the ordering of "u" with respect to "t" for every possible immediately previous letter, one can choose to store information concerning only those exceptional cases in which "u" should be ordered before "t". Depending on exactly how the regular ordering and the exceptions are stored, storing just the exceptions can result in reduced storage requirement. This process will be referred to here as "hierarchical differentiation" and will be explained in more detail in the detailed specification below.
FIG. 1 shows a schematic diagram of a telephone 100 showing the standard assignment of letters to keys 101. There are no letters assigned to the key labeled 1, and 3 to 4 letters are assigned to each key labeled 2 to 9, in alphabetic order. In the prior-art multi-tap method, to type the word "car", for instance, one would press the 2 key three times to select the letter "c", and then the 2 key once again to select the letter "a", and finally the 7 key three times to select the letter "r". Thus, to type the word "car" requires a total of 7 keystrokes, 4 more than would be required to type the same word on a standard typewriter keyboard. The number of keystrokes required to type a word on a telephone keypad over and above the number of keystrokes required to type the same word on a typewriter keyboard will be referred to as the excess number of keystrokes. The essential object of this invention is to reduce the excess number of keystrokes to as close to zero as possible.
Consider entering the word "car" on a telephone keypad on which 2 is associated with the letters a,b,c, but these letters are presented in the order c,a,b, and 7 is associated with the letters p,q,r,s but presented in the order r,s,p,q. In this case it would require only 1 excess keystroke to type the word "car", rather than 4 excess keystrokes in the standard multi-tap method. Thus, reordering the letters associated to a key can change the number of excess keystrokes required to enter a word. The number of excess keystrokes can be further reduced if the ordering of letters changes dynamically as words are typed. For instance, if initially the ordering of letters associated to the 2 key were c,a,b, and then, once "c" had been entered, the order changed to a,b,c, while the ordering on the 7 key remained as r,s,p,q, then it would require no excess keystrokes to type the word "car". If the order were always changed so that the first letter in the ordering is the letter the user desired to type, then no excess keystrokes would ever be required.
This ideal situation cannot be obtained in practice, however this invention teaches a method and apparatus by which the ideal situation can be approached quite closely. The method requires the selection of an ordering for each key at each moment in such a way that the expected number of excess keystrokes is minimized, and the apparatus is a device which functions by this method.
The way the apparatus is used is explained in reference to FIG. 2. Initially, at step 1000, the user selects the input means corresponding to the symbol that he or she wishes to type. Then, at step 1001 the apparatus invokes means to select an order for the symbols associated to that input means, based on the prefix, that is, based the symbols which have been previously entered by the user. Then, at step 1003, the apparatus presents via a visual or auditory display means, the first symbol in the ordering selected. The user then perceives the symbol, and if the user finds the presented symol to be the desired symbol(step 1005), this symbol is allowed to be output by the apparatus at step 1007. If, however, the presented symbol is not the correct symbol, then (step 1009) the user will activate an input means to present the next symbol in the ordering. In the prior-art multi-tap method, the input means used to present the next symbol in the ordering in step 1009 is the same input means used to present the initial symbol in step 1000. In the improved method taught by this invention, the input means used to advance in the ordering in step 1009 could be the same input means as used in step 1000, or, preferably, it is an auxiliary input means devoted to this purpose, as explained further below.
Steps 1005 and 1009 are repeated alternately until the desired symbol is presented to the user and output.
Referring now to FIG. 3, we examine in overview some of the essential features of the apparatus of this invention. Entry of symbols is via a plurality of input means 5000, typically embodied as a keyboard to be operated by the fingers and thumbs of the user, though the input means could also be embodied in many different ways, such as a voice-recognition system, a breath-velocity detector, and so on. Signals from the input means are transmitted to an ordering selector 5001 which selects an ordering for the display of symbols based on the current input means activation, and, preferably, the recent history of input means activations. When history information is used in an embodiment, said history information is stored in a situation memory means 5003. The orderings selector selects an ordering from the database of orderings 5002 in an appropriate way depending on the current situation, that is, the current input means manipulation, and, preferably, the recent history of input means manipulations. The ordering selected is communicated to the coupler of orderings to symbols for display 5004 which is effective to select a symbol to display on the display means 5005, depending on 1) the set of symbols associated to the relevant input means, and 2) the ordering communicated from the ordering selector 5001. The display means will typically be a visual display means, but could also be an auditory display means which, for instance, speaks the symbol to the user via a voice-synthesis means, or a tactile communication means whereby the symbol is communicated to the user by a vibration, etc.
Prefixes and Positions. For the purposes of this disclosure, the prefix of a symbol is the set of symbols typed immediately preceding the symbol which is to be typed. The terms symbol and letter may be used interchangeably in this disclosure. For instance, in the word "car" the 1-letter prefix of the letter "r" is the letter "a", the 2-letter prefix of "r" is "ca", and the 3-letter context of "r" is "_ca" where "_" is used to denote a space or other punctuation mark. The term position will be used to refer to the number of symbols before a given symbol, up to and including the last punctuation mark. Thus, "r" is in position 3 in the word "car".
It has been discovered that the best ordering for the symbols associated to a given input means is a function of the prefix and of the position of the symbol to be typed using the input means. Thus, in essence, this invention concerns using prefix and/or position information to choose an ordering of the symbols associated to an input means.
Choosing an ordering as a function of a prefix. To simplify the discussion, let us consider a language consisting of three words aba, cca and cac, with probabilities of occurrence of 0.1 0.3 and 0.6 respectively. All of these words can be typed with the 2 key of the standard telephone keypad. In the standard ordering of letters, a,b,c, these words will require 1, 4, and 4 excess keystrokes respectively. The expected number of excess keystrokes per letter is thus (0.1*1+0.3*4+0.6*4)/3=1.23. To reduce the number of excess keystrokes, we would prefer to choose the order c,a,b, since "c" is the most probable first letter, "a" is the second most probable first letter, and "b" never occurs as a first letter. Similarly, at the second position, we find that "a" is the most probable second letter, "c" is the next most probable second letter, and "b" is the least probable second letter, suggesting that the ordering c,a,b be used again at the second position. Finally, at the third position, we would choose the ordering c,a,b again since "c" is the most probable letter in the third position, and "b" never occurs in the third position. By reordering the letters to c,a,b, we reduce the expected number of keystrokes to (0.1*4+0.3*1+0.6*1)/3=0.433, a very significant improvement. We can do better, however, by using prefix information. The following 2-letter sequences occur in these words: ab, ba, cc, ca, and ac, with probabilities 0.05, 0.05, 0.15, 0.45, and 0.3 respectively, ignoring the position in which these prefixes occur. Thus, given that the letter at some position is "a", the probability that the next letter is also "a" is 0, the probability that the next letter is "b" is 0.05/(0.05+0.3)=0.14, and the probability that the next letter is "c" is 0.3/0.35=0.86. We should choose the order c,b,a in order in minimize the number of keystrokes, whenever an "a" has been entered just before the letter which is to be entered next. Similarly, if the previous letter is "b", we should choose the orders a,b,c or a,c,b, and if the previous letter is "c" we should choose the order a,c,b. Using 1-letter, position-independent prefix information, Consider now typing the word "cca". For the first position, there is no letter prefix, and so we use the default ordering c,a,b. Then, since "c" is entered, we use the order a,c,b, and finally, since c is entered again, we again use the order a,b,c. We will enter the word with one extra keystroke. Computing the number of keystrokes for the other words in the same way, we find that the expected number of excess keystrokes for this language is 0.17.
Combining prefix and position information. In the above calculation, we chose an order based on prefix information, ignoring position information. However, by examining these words, we find that if "a" is in the first position, then "b" should be offered as the first choice in the second position, since "a" is only in the first position in the word "aba". However, if "a" is in the second position, then "c" should be offered as the first choice, since "a" only occurs in the second position in the word "cac". In this way, the ordering to choose can depend not only on the prefix, but also on the position in which that prefix occurs. Now we find that we need one extra keystroke to enter the word aba, 1 extra keystroke to enter the word cca, and no excess keystrokes to enter the word cac, giving an expected number of excess keystrokes for the language of (1*0.1+1*0.3)/3=0.13. The expected number of excess keystrokes has been reduced to nearly {fraction (1/10)} of the expected number of excess keystrokes in the prior-art method.
Given these teachings, it should now be evident to one skilled in the art that one can use prefixes of more than one letter, and languages composed of an arbitrary number of words composed of an arbitrary number of symbols and of arbitrary lengths.
An example sentence. To see the result of applying these teachings to an example sentence, we refer to FIG. 4a. Here, a sentence is shown with the excess number of keystrokes required to enter each letter shown below the letter. For clarity, a blank is used to indicate 0 excess keystrokes. Similarly, the number of excess keystrokes required to input the same sentence when orderings are chosen according to position-dependent prefixes of length 1 (FIG. 4b) and position-dependent prefixes of length 4 (FIG. 4c) are shown. To compute the number of excess keystrokes, a set of reference statistics of the probability of words in English was used. As long as the statistics used to chose orderings are sufficiently representative of a language, results similar to these should be obtained. It is clear that the number of excess keystrokes needed decreases as the size of the prefix used increases.
Dependence of the excess number of keystrokes on prefix size and position. In order to appreciate the utility of the database compression techniques which will be explained below, and for which patent rights are hereby claimed, it is important to understand the effects of prefix size and position dependence on the expected number of keystrokes. It will be shown that the longer the prefixes that can be used, the greater the improvement of the present invention over the prior-art multi-tap method. However, as the length of the prefixes increases, the amount of storage which is required may increase dramatically, making efficient storage of information a priority. Referring now to FIG. 5, we find data plotted which helps to understand the relative impact of positional information and prefix size on the expected number of keystrokes. Shown on the horizontal axis is the size of prefixes used in a prior-art multi-tap method (size 0 prefix, alphabetic ordering), and prefixes of size 1 through 4 for the improved multi-tap method. Plotted on the vertical axis is the expected number of keystrokes. These data were obtained relative to a reference dictionary of English words, together with their probabilities. The curve 200 shows the expected number of keystrokes when position-dependent prefix information is used, and the curve 201 shows the expected number of keystrokes when positionally information is ignored, and only prefix information is used. It is seen that as the length of the prefixes used increases, the expected number of keystrokes decreases rapidly, for both position-dependent and position-independent data. No increase in prefix length can compensate fully for neglect of positional information, however. With increasing prefix size, both position-dependent and position-independent curves approach an asymptote (curves 202 and 203 respectively), and the position-independent asymptote is higher than the position-dependent asymptote. Nonetheless it is clear that increasing prefix size has a stronger effect than inclusion of positional information, at least up to prefix sizes of 3 or 4.
Referring now to FIG. 6, we see that the effect of decreasing expected number of keystrokes with increasing prefix size is not limited to the English language. Here, the same position-dependent curve 200 from FIG. 5 is shown in relationship with a variety of curves 204 based on data from a variety of other Romance and Germanic languages. While each of these curves follows the same general course, the asymptotic values are higher for the other languages, due to the fact that these languages are written with a larger number of symbols than English, owing to the use of accented letters. Similar curves can be expected for any natural language.
Another way to grasp the degree to which the present invention improves over the prior-art multi-tap method is by reference to the data presented in FIG. 7. Here, the expected excess number of keystrokes is plotted as a function of position in a word, using the prior-art multi-tap method 300, and the improved multi-tap method taught by the present invention, and using position-dependent information and prefixes of length 4, curve 301. It is seen that for the the prior-art method the expected number of excess keystrokes remains fairly constant or even increases with the position in the word. In the improved method, however, the expected number of keystrokes decreases rapidly with position in the word. Most of the excess keystrokes required to enter a word using the improved method are required to enter the first letter of a word. Once this first letter has been correctly entered, a prefix has been established which allows the desired letter to be presented first in order with an increased reliability. BEST MODE STORAGE METHOD
To understand the best mode storage method, consider a topographic map, with large, flat regions such as lakes, and various more rugged features such as mountain ranges. Your task is to make as accurate a model as possible of the map, using as tools a collection of disks of various diameters and heights, which you can stack one upon the other. To succeed, you must not only make an accurate model, but one which uses a minimum number of disks. In regions in which the terrain changes slowly, you can produce a good representation with a small number of large disks. However, when the terrain changes rapidly, you will need a large number of smaller disks to track the changes. If you are only allowed a fixed number of disks to construct your model, there will always be some optimal way to choose the disks so as to produce a high-quality model.
To make the link with the present case, consider the height and width of the disks as corresponding to prefixes and positions within a word. The larger the disk, the smaller the prefix. You can think of the prefix as giving the location of a place on the map to be covered, and the smaller the area is, the longer and more detailed the address needed to specify the area. Finally, the topography of the map corresponds to the variability of the excess number of keystrokes as a function of prefix and position-within-a-word.
More formally, define a pset (permutation set) to be a quadruple (key,prefix,position,permutation). A pset has the following interpretation: If key is pressed, when prefix has been entered at position in a word, then present to the user the symbols associated to key in the order given by permutation. A database of orderings is a collection of psets.
To use a database of orderings to control the presentation of symbols to a user, we need a function MATCH(situation,pset), which determines if a pset corresponds to the current situation, where a "situation" comprises the current prefix to the key just pressed at some moment during text entry, the current position within the word when that keypress occurs, and the key that has just been pressed, that is, a "situation" is a pset with no permutation specified.
We also need a function COMPARE(pset1,pset2) which rates psets relative to each other for their applicability to the current situation.
The use of MATCH and COMPARE can be understood by reference to FIG. 8. In the first step 3000, and for each pset in the database, MATCH determines if the current prefix corresponds to the input pset, if the current position is compatible with the position in the pset, and if the key of the pset corresponds to the key which has just been pressed. It is obvious how to determine correspondence in terms of key. To correspond in terms of position, the position of the pset must be less than or equal to the current position. To correspond in terms of prefix, the prefix of the current situation must contain the prefix of the pset. Containment is determined by comparing the prefix of the pset to the current prefix letter by letter, beginning with the letter just before the current position, and working backward toward the beginning of the word. For instance, if the current prefix is _ga, then psets with either the prefix a or the prefix ga match the current situation, any other prefix, such as fga does not match the current situation, except the NULL prefix, which matches all prefixes.
After the completion of step 3000 all psets have been identified as matching or not matching the current situation. In step 3001, all those psets which match are ordered with respect to each other using the function COMPARE.
In constructing the database, a process to be discussed further on, a decision was made to rate positional correspondence above prefix correspondence, or vice versa. Without loss of generality, let us assume that positional correspondence is rated above prefix correspondence. Then, given two psets, pset1 and pset2, COMPARE will return pset1 if the position of pset1 is closer to the current position, and pset2 otherwise. The pset returned will be placed higher in the ordering than the other pset. If the positions of pset1 and pset2 are the same, then COMPARE will return the pset with the longest prefix.
Once all the matching psets have been sorted relative to each other using COMPARE, there is one highest-rated pset. In step 3002 the permutation of this pset is chosen for use in ordering the symbols to be presented to the user.
The best-mode method for constructing a database of orderings will be described in reference to FIG. 9. In the first step of database construction 4000, all possibly relevant psets are constructed from a database of words (a dictionary) along with their probabilities. The probability to assign to the pset is the probability that it will match the current situation at any given time. The probabilities will be used to give a rating to the psets. All possible psets includes all possible choices for key, prefix (including the null prefix) and position which occur in words in the dictionary, each of these choices of key, prefix, and position associated to each possible permutation of the symbols associated to the key. The number of such psets is finite since the number of keys is fixed, no prefix can be longer than the largest word in the dictionary, and no position can be larger than the length of the longest word. Still, the number of possible psets could be quite large, and one may decide to limit the number of psets a priori by fixing a longest prefix to be considered, binning the positions into a small number of bins so that positions within a bin are considered equivalent, etc.
Next, in step 4001, an initial rating is assigned to each of the psets. This rating is based on the reduction in the expected number of keystrokes required to enter the words in the dictionary, if the given pset were to be included in the database of orderings, relative to the expected number of keystrokes required when the symbols are presented in some initial default ordering, such as alphabetic ordering. This reduction can be calculated rapidly, since, for each pset, one only need consider the words to which the pset matches, and count the number of excess keystrokes required if the pset were to be used. For instance, if the dictionary consists only of the word "the", then only those psets with (position,prefix) pairs: (1,NULL), (2,NULL), (2,t), (3,NULL),(3,h), and (3,th) need to be considered (NULL represents the null prefix, that is, no prefix at all). For each of these psets, and for each possible permutation, the reduction in the number of excess keystrokes is computed.
Once all psets have thus been rated, that pset with the largest rating, that is, the pset which produces the maximal reduction in expected number of keystrokes, is entered into the database of orderings (step 4002). If there is more than one maximally rated pset, the one with the lowest position is chosen, if all have the same position, then the one with the smallest prefix is chosen, and if all have the same size prefix and same position, one of them is chosen at random.
Now, to find the next pset to be included in the database 4003, the ratings of all the psets has to be recalculated. The rating of a pset is now based on the reduction in the number of keystrokes relative to the default orderings and the database of orderings thus far constructed. Consider, for example, the case given above in which the only word in the dictionary is "the". Assume that the pset (4,2,NULL,hig) (meaning: for key 4, pressed at the second position, regardless of prefix, present the letters in the order h,i,g) has been selected at step 4002 for inclusion in the database. Now the pset (4,2,t,hig) will have a 0 rating: any effect it might have has already been accounted for by the pset included in the database. Note that initially the psets (4,2,NULL,hig) and (4,2,t,hig) have the same rating, and, given the rule that if two psets have the same rating, the one with the smallest prefix is chosen, (4,2,NULL,hig) would be inserted in the database rather than (4,2,t,hig). This preference accomplishes hierarchical differentiation. Similarly, the psets (a) (3,1,NULL,edf), (b) (3,2,NULL,edf) and (c) (3,3,NULL,edf), which mean respectively (a) if key 3 is pressed, at any position 1 or greater, and regardless of prefix, use the order e,d,f, (b) if key 3 is pressed, at any position 2 or greater, and regardless of prefix, use the order e,d,f, (c) if key 3 is pressed, at any position 3 or greater, and regardless of prefix, use the order e,d,f, each have the same effect on the excess number of keystrokes required to enter the word "the". Given the rule that if psets have the same prefix and the same rating, the one with the lowest position is preferred, pset (a) will be chosen. This rule accomplishes positional differentiation.
Steps 4002 and 4003 can now be repeated as many times are required to find additional psets to include in the database. At each iteration, ratings will have to be recalculated for certain psets, those which could be affected by the last added pset to the database. Only those psets which have a position greater than or equal to the last added pset, and have a prefix which includes or is included by the prefix of the last added pset, and apply to the same key as the last added pset need have their ratings recalculated, and only these psets need to be resorted in relationship to the other psets.
This process describes the construction of a database of orderings essentially ab initio. In practice one might wish to begin the process by first including some larger subset of orderings known to be useful, such as all orderings with prefixes up to length 1. Regardless of the initial set of psets, addition of psets can proceed as described above.
This best mode method is but one of an infinite number of embodiments of the general principles taught by this invention for reducing storage requirements. These principles are two: 1) positional differentiation, in which advantage is taken of the fact that typically positions nearby each other will require similar orderings, and 2) hierarchical differentiation, in which advantage is taken of fact that longer prefixes will typically require orderings similar to the orderings consistent with shorter prefixes. The best mode storage method combines these principles in a way which is particularly useful when an amount of storage to be allocated to the database of orderings is fixed in advance. Using the best mode method, whatever storage is available for the database can be filled in a way which is optimal for reducing the expected number of keystrokes.
In the prior-art multi-tap method, some method must be used to distinguish multiple taps which are meant to advance in the ordering of symbols and multiple taps which are meant to input new letters. For instance, the word "cab" is typed entirely using the 2 key, with three taps, one tap and two taps for the letters c,a and b respectively. Grouping these taps to represent letters is usually done in one of two ways, 1) a timing mechanism is used: closely spaced taps are interpreted as being in the same group, while a longer space between taps encodes the beginning of a new group, or 2) an auxiliary key, typically the # key on the telephone key pad, is used as a letter-ending symbol, so that "cab" is entered as 222#2#22#. The first of this methods has the drawback of limiting the speed at which a user can type. Such a keyboard requires the user to type neither too quickly, nor too slowly. It is particularly unsuited for the improved multi-tap method taught by this invention. The second method has the drawback of added an extra keystroke for each letter, further slowing input.
This invention thus provides for an auxiliary key to be used to advance symbols in a given ordering. Referring to FIG. 10, we see how this auxiliary input means can be integrated into the apparatus of this invention. The auxiliary input means 5007 communicates with the coupler of orderings to symbols for display 5005 in such a way that each manipulation of the auxiliary input means 5007 causes the symbol displayed to be advanced one in the ordering. This auxiliary key could be applied as well to improve the standard multi-tap method. In this case the order does not depend on context, still the auxiliary input means apparatus can be applied to advance symbols in the given, fixed ordering.
Following the teachings of this invention, the improved or prior-art multi-tap method can be use in integrated combination with ambiguous code methods, such as those taught in US provisional application number 60/111,665 (GUTOWITZ '98), which is hereby incorporated by reference. For definiteness, we will describe a combination with the embodiment of GUTOWITZ '98 in which several selected letters are input by substantially simultaneous manipulation of two input means. The worker skilled in the art will be able to extend these teachings to combination with any other ambiguous code method. However, if this combination is not done properly, then the benefits of the ambiguous code method can be compromised by the ambiguity introduced by the combination with the multi-tap method. A particularly effective method for combining multi-tap and ambiguous-code methods, for which patent rights are hereby claimed will now be described.
It was shown in GUTOWITZ '98 that operation of an auxiliary input means with one of the letter keys of the standard telephone keypad can serve to encode a selected letter, and that, further, if the letters encoded in this way are selected to be c,e,h,l,n,s,t,y then the ambiguity, as measured by lookup error and query error, is substantially reduced as compared to the standard ambiguous code. We will therefore adopt this code for the present discussion. One way to combine those teachings with the teachings of the present invention is to combine evidence from both multi-tap input and ambiguous code input to select a most-likely word or letter from a set of possible words or letters.
Referring now to FIG. 11, we find a schematic overview of an apparatus in which both a multi-tap and a predictive text input means are integrated. The multi-tap components of this figure have been already presented in detail. Component 5009 is a predictive text input component, which could be for instance, one of the predictive text input embodiments described in GUTOWITZ '98. For the embodiment to be discussed in more detail below, that embodiment in which selected letters from each input means which encodes letters are selected by manipulating an auxiliary input means in conjunction with one of the letter-encoding input means, an auxiliary input means for predictive text input is required. This auxiliary input means is shown in FIG. 115008, and is preferably distinct from the other input means of the apparatus, in particular, the auxiliary input means for multi-tap input 5007, when said auxiliary input means for multi-tap input is present in the apparatus.
Consider an extreme case in which a user may at any moment choose to use either the ambiguous code method or the improved multi-tap method. Most words could be entered in a variety of ways. For instance, consider entering the word "bed". We will assume for this example that the order c,a,b is always chosen by the improved multi-tap method for the letters associated to the 2 key, and the order d,e,f is always chosen by the improved multi-tap method for the letters associated to the 3 key. We will use a space to denote operation of a letter ending means, such as a timeout. For the ambiguous code method, we will write {circumflex over (2)} to indicate operation of the auxiliary key in combination with the 2 key, {circumflex over (3)} to indicate operation of the auxiliary key with the 3 key. Using only the improved multi-tap method, the word "bed" would be entered as 222 33 3, and using the ambiguous code method as 2{circumflex over (3)}3. Now imagine that the user types 2{circumflex over (3)}3, and we allow interpretation by both the ambiguous code and improved multi-tap methods. When the sequence 2{circumflex over (3)}3 is received, we do not know if the user intended only the second letter to be typed using the ambiguous code method, or all of the letters, or only the first and second letters, or only the second and third letters. Thus, this sequence could be interpreted as "bed" (pure ambiguous-code interpretation) or "ced" (first and/or third letters are multi-tap). However, assuming that "ced" is not a word in the dictionary, this hypothesis can be rejected, and the sequence rendered as "bed".
Consider now the sequence 22 3 3, in improved multi-tap this is "add", and in the ambiguous-code interpretation "aadf", "abdf", "badf", "bbdf", "aafd", "abfd", "bafd", "bbfd", "aadd", "abdd", "badd", "bbdd", "aaff", "abff", "baff", "bbff". Let us assume that one of these, for instance, "baff" is a word. Now there are two possible interpretations of the input sequence, "add" or "baff" and a query would need to be presented to the user, to allow the user to select the interpretation which is meant.
These examples show that both multi-tap methods and ambiguous code methods can be operational at the same time. In the case of conflicts or ambiguities, queries can be presented to the user to allow the user to resolve the conflict or ambiguity.
Many variant methods for integrating ambiguous-code and multi-tap methods may be designed. For instance, based on the data presented previously, one good method could be to use multi-tap systematically for the first letter of a word, and then the ambiguous-code method systematically for all the other letters of the word.
The best mode for synergistic integration of ambiguous-code and multi-tap methods emerges from several inventive insights: 1) multi-tap methods will be of most use for words not likely to correctly rendered by an ambiguous code method, such as proper names, 2) users are unlikely to want to use both ambiguous-code and multi-tap methods within a single word, 3) by using a distinct auxiliary input means for ambiguous-code input and another distinct auxiliary input means for multi-tap input, it can be relatively easy to determine if a user means to use the ambiguous-code method or the multi-tap method to enter any given word, 4) but using sequential signals, that is, by having operation of the ambiguous-code auxiliary input means precede the letter to which it refers, and the multi-tap auxiliary input means succeed the letter to which it refers, the ambiguity introduced by possibly simultaneous interpretations in terms of ambiguous-code or multi-tap methods can be reduced.
Thus, the best mode for synergistic combination of ambiguous-code and multi-tap input can be understood in more detail as follows.
Most of the ambiguities resulting from multiple interpretations due to combinations of multi-tap and ambiguous code methods are due to letter-boundary confusions in the multi-tap method, be it the improved multi-tap method or the prior-art multi-tap method. That is, for example, one does not know if a repeated sequence, such as "22" should be considered as representing a single or several letters. Since in the improved multi-tap method, the probability of needing multiple taps to input a letter is small, multiple taps can be ergonomically accomplished by means of an auxiliary input means operated in conjunction with a letter-encoding input means. Let us represent by *2 the operation of an auxiliary input means with the 2 key. Then, if the order of letters on the 2 key is c,a,b, then c is encoded by "2", a by "2*2", and b by "2*2*2". Now, using the notation as above for {circumflex over (2)} meaning operation of the auxiliary input means for ambiguous-code input on the 2 key, the word "cab" can be entered as 22*22*2*2 using just the multi-tap method, or {circumflex over (2)}22 using just the ambiguous-code method. If both input methods are available simultaneously, then the user can chose to enter "cab" in any of the following ways: {circumflex over (2)}22, {circumflex over (2)}2*22, {circumflex over (2)}2*22*2*2, {circumflex over (2)}22*2*2, 222, 22*22, 22*22*2*2 and 222*2*2.
These 8 possibilities can in part be uniquely associated with letter sequences: a "star" sequence can only be read in one way, and a "{circumflex over (.)}" sequence can only be read in one way. Thus, the 8 possibilities can be rendered: c22, ca2, cab, c2b, 222, 2a2, 2ab, 22b. Here, partial sequences have been replaced with letters whenever this can be done unambiguously. Each of the remaining 2's in these sequences represent a "c" if interpreted in a multi-tap interpretation, and "a or b" if interpreted in an ambiguous code interpretation. Thus each 2 can be any of a,b, or c. If only by virtue of the sequence "222", any of the 9 possible permutations of a,b,c, are possible and thus this example reduces to coding using the standard ambiguous code.
This example is an extreme case which illustrates all of the possible combinations of coding using the standard ambiguous code, a reduced-ambiguity code, and a multi-tap method. In this example the additional ambiguity due to the possibility of interpretation in either a multi-tap mode or a reduced-ambiguous-code mode, resulted in a total ambiguity which is no less than that of the standard ambiguous code. In a typical case, however, additional information input by means of manipulation of the auxiliary input means will serve to reduce ambiguity relative to the standard ambiguous code.
According to the best mode of operation of this invention, the ambiguity due to possible simultaneous interpretations in terms of an ambiguous code or a multi-tap code can be reduced by creating a precedence relationship between the two possible interpretation mechanisms. The following convention is optimal in that 1) it allows for multi-tap input to be used for words which are not likely to be in the dictionary, and thus not likely to be correctly interpreted, and yet 2) allows words which are likely to be in the dictionary to be typed using the ambiguous-code method, and 3) permits learners of the ambiguous-code method to make a smooth transition from multi-tap in ambiguous-code input during the learning process. The convention is that words are to be interpreted in a multi-tap interpretation unless any of the letters in the word are entered using the ambiguous-code auxiliary input means. The reverse convention is also possible.
For typical words, one or the other of the auxiliary input means will be required to enter the word, and thus it is straight forward to determine if the user meant to enter the word using the multi-tap or ambiguous code method. We have seen that for English there are on average 15% excess keystrokes per letter, and thus, for each letter, a 15% chance to use the multi-tap auxiliary input means, for devices which use an auxiliary input means in the multitap mode. Since the average word in English is approximately 5.5 letters long, there is a 60% chance that the multi-tap auxiliary input means will be used at least once in any given word. In the same way, for the reduced-ambiguity ambiguous code described above, the auxiliary input means has a 45% chance of being used to enter any given letter, and thus a 96% chance to be used at least once while entering an average word when the word is entered using this method. Thus, most of the time, it can easily be determined in software which method the user intended to use on any given word according to which of the auxiliary input means was used in the course of entry of the word. If neither of the auxiliary input means is used in a given word, some default arrangement may be made, preferably, to interpret the word in the ambiguous-code method.
While the user is learning the use of the ambiguous code auxiliary input means, it may be preferable to adopt the multi-tap interpretation for all letters, except those entered using the auxiliary input means for ambiguous-code text entry. In this way, the use of the auxiliary input means for ambiguous-code text entry can be introduced gradually, and will always provide some benefit in enabling the user to enter certain letters directly and unambiguously, without passing through a multi-tap interpretation.
Though it may not contribute to reduction in total ambiguity, it is considerably more ergonomic to perform the combination of auxiliary input means with symbol encoding means in two different ways, depending on whether the auxiliary input means associated to the ambiguous-code method, or the auxiliary input means associated to the multi-tap method is concerned. In the case of the ambiguous-code auxiliary input means, the auxiliary input means activation should occur before or during the activation of the symbol-encoding input means to which it refers, while in the case of the multi-tap method, the auxiliary input means activation should occur after the activation of the symbol-encoding means to which it refers. In typical use, the ambiguous-code entry method will be used words expected by the user to be in the dictionary, while the multi-tap method will be used for words which the user expects not to be in the dictionary.
Multi-tap typable devices are not touch typable: each symbol is not always gotten by the same sequence of input means manipulations. Nonetheless, many of the methods used for typable device optimization disclosed in GUTOWITZ '98 can be applied to multi-tap devices. According to the teachings of the present invention, one essential ergonomic criterion for multi-tap methods is the expected number of excess keystrokes. Following the teachings of GUTOWITZ '98, the excess number of keystrokes could be reduced by choosing an optimal assignment of symbols to keys. In particular, alphabetic ordering could be maintained while reducing the number of keystrokes, by choosing an optimal partition of the symbols.
Up to now, we have been considering choosing orderings with respect to statistics drawn from a representative sample of the language to be typed. In some circumstances, other orderings may be preferred. For instance, when the improved multi-tap method and apparatus taught by the present invention is used to enter and access names and addresses in a database on a handheld device such as a cell phone or personal digital assistant, then the relevant statistics are those of names and addresses, not those of general language. Indeed, one might choose statistics drawn from a large set of names typical of a language when the device is used for entering names, and the statistics of the names already input into the device when the device is used to access names. In the latter case, the weighting of letters and prefixes could be a function of the number of times the names and addresses in the database have been accessed, rather than statistics based on the general usage of such names by a population of users.
Distant database storage. The database of orderings need not reside on the physical device used for text entry. Consider, for instance, an automated corporate switchboard which permits callers to be connected to employees when the caller enters the name of the employee by typing on a telephone keypad. The optimal orderings may be different from the optimal orderings for entering unrestricted language, and the automated switchboard could communicate selected orderings to the caller's phone, interactively as the caller types. Such a setup presents a number of advantages: not only are the orderings adapted to the corporation's telephone data, but also, minimal storage and processing is required in the user's handset. Preferably, the user handset is capable of signalling the user as to which letter choice is being made. However, the method can operate even with no specialized handset equipment beyond a standard telephone. In this case, voice synthesis software, operating on a remote computer, can serve as the display means. Alternative choices of orderings are also appropriate when filling out computer based forms. Some fields in some forms may require input from different subsets of language, and thus different statistics, and thus different optimal orderings. For example, while entering a URL (Universal Resource Locator), one finds that the sequence "www" is very common, while in general language it is rather uncommon. Thus, an ordering conditional on a sequence of w's which causes w to be presented first in an order would be appropriate for a field in which a URL is to be entered, but would be potentially inappropriate for a field set to receive unrestricted English input.
In conclusion it is noted that numerous embodiments of the teachings of the present invention beyond those specifically described here are possible, and which do not extend beyond the scope of those teachings, which scope is defined by the appended claims. In particular, it is obvious even to one not very skilled in the art that these teachings are not limited to application to the standard ambiguous code, to the languages here chosen for illustration, or to applications to telephones. Essentially any electronic device could potentially benefit from text input means, and thus from the teachings of this invention. It is further obvious that the text-input methodology described here could be combined with well-known word-completion mechanisms to further reduce the number of keystrokes required for some varieties of text input.
U.S. Pat. No. 5,818,437, Reduced keyboard disambiguating computer, Inventors: Grover; Dale L., King; Martin T., and Kushler; Clifford A. Oct 6, 1998
US provisional application number 60/111,665, Dec. 10, 1998, "Touch-typable devices based on ambiguous codes and methods to design such devices", Inventor: Howard Gutowitz.
1. An apparatus for inputting text using multi-tap, comprising
- a plurality of symbols;
- a plurality of key inputs, at least one of said plurality of key inputs associated with a portion of said plurality of symbols,
- a display, a database of psets, each of said psets having a permutation of some of said plurality of symbols, at least two of said psets having a permutation of said portion of said plurality of symbols associated with said at least one of said plurality of key inputs wherein said permutation of a first of said at least two psets is shift-inequivalent of said permutation of a second of said at least two psets,
- wherein when said at least one of said plurality of key inputs is activated, said portion of said plurality of symbols is displayed on said display according to said permutation of one of said at least two psets.
2. The apparatus of claim 1 wherein said at least one of said psets has a position-dependent permutation and wherein when said at least one of said plurality of inputs is activated, said portion of said plurality of symbols is displayed on said display according to said pset having said position-dependent permutation.
3. The apparatus of claim 2 wherein said position-dependent permutation is position-differential.
4. The apparatus of claim 1 wherein said at least one of said psets has a prefix-dependent permutation and wherein when said at least one of said plurality of inputs is activated, said portion of said plurality of symbols is displayed on said display according to said pset having said prefix-dependent permutation.
5. The apparatus of claim 4 wherein said psets having said prefix-dependent permutations have prefixes of variable length.
6. The apparatus of claim 1 said database of psets is coupled to said key inputs via a telecommunications link.
7. The apparatus of claim 1 further comprising at least one auxiliary input, wherein when said auxiliary input and said at least one of said plurality of key inputs are activated, said permutation of said at least one of said psets is changed.
8. The apparatus of claim 1 wherein said symbols displayed on said display are transmitted and stored.
9. The apparatus of claim 1 wherein said display is selected from the group consisting of a visual and auditory display.
10. The apparatus of claim 1 in which said psets have different permutations depending on whether said apparatus is used for text input or text retrieval.
11. The apparatus of claim 5 wherein said prefix-dependent permutation is hierarchical-differential.
12. A method for constructing a database of psets for use in a multi-tap input device, said device having a plurality of key inputs and a display, said device being used to input text formed from a plurality of symbols, the method comprising the steps of:
- associating with at least one of said key inputs a portion of said plurality of symbols;
- forming at least two psets having permutations of said portion of said plurality of symbols so that said permutation of a first of said at least two psets is shift-inequivalent of said permutation of a second of said at least two psets,
- displaying on said display said portion of said plurality of symbols according to said permutation of one of said at least two psets when said at least one of said plurality of key inputs is activated.
13. The apparatus of claim 1 further comprising predictive text input means selectively operable to interpret sequences of operations of input means as text.
14. The apparatus of claim 13 further comprising means to determine if said orderings or said predictive text input means should be used to determine the symbols displayed on said display means.
15. The apparatus of claim 1 wherein said database of psets comprises field-dependent psets for entering text into computerized forms having text entry fields.
16. The method of claim 12, wherein the step of forming at least two psets further includes the step of:
- selecting said permutations of said at least two psets based on position information.
17. The method of claim 12, wherein the step of forming at least two psets further includes the step of:
- selecting said permutations of said at least two psets based on prefix information.
18. A method of forming a database having N psets, each if said psets having a permutation formed from a portion of a plurality of symbols, the method comprising the steps of:
- (a) forming a set of psets;
- (b) including in said database a pset from said set of psets;
- (c) selecting another pset from said set of psets;
- (d) assigning a rating to said another pset based on psets included in said database of psets;
- (e) repeating steps (c) and (d) until all psets in said set of psets have a rating
- (f) including in said database said one of said set of psets having the largest rating; and
- (g) repeating steps (c)-(f) until said database of psets has N psets.
19. The method of claim 18 wherein said step of forming a set of psets includes the step of:
- forming said set of psets using position information.
20. The method of claim 19, further including the step of:
- including in said database of psets only those psets of said set of psets having a low position.
21. The method of claim 18 wherein said step of forming a set of psets includes the step of:
- forming said set of psets using prefix information.
22. The method of claim 21, further including the step of:
- including in said database of psets only those psets of said set of psets having a small prefix.
23. The method of claim 18, wherein said database of N psets is used in a multi-tap input device and N is selected so as to minimize multi-taps.
24. The method of claim 18, wherein said database of N psets is used in a multi-tap input device having an amount of storage and N is selected so as to minimize said amount of storage.
Referenced Cited
U.S. Patent Documents
|December 1975
|August 16, 1977
|Bequaert et al.
|November 15, 1977
|March 17, 1987
|July 14, 1987
|Davis, II et al.
|April 12, 1988
|Curtin et al.
|January 2, 1990
|July 9, 1991
|June 9, 1992
|Danish et al.
|July 7, 1992
|August 16, 1994
|Danish et al.
|February 21, 1995
|Danish et al.
|August 20, 1996
|Gahang et al.
|September 24, 1996
|Jasinski et al.
|August 26, 1997
|Wang et al.
|May 5, 1998
|Baker et al.
|August 18, 1998
|Schroeder et al.
|June 15, 1999
|June 29, 1999
|Whipple et al.
|September 14, 1999
|King et al.
|September 28, 1999
|Skiena et al.
|November 9, 1999
|White et al.
|November 23, 1999
|December 21, 1999
|December 21, 1999
|Connolly et al.
|January 4, 2000
|King et al.
Foreign Patent Documents
|September 1996
Other references
- Shannon, C.E., "Prediction and Entropy of Printed English", Bell System Technical Journal, vol. 27, pp. 51-65, Jan. 1951.
- Arnott, J.L. and Javed, M.Y., "Probalistic Character Disambiguation for Reduced Keyboards Using Small Text Samples, AAC Augmentative and Alternative Communication", vol. 8, Sep. 1992.
- Foulds, R.A., Soede, M., and Van Balkom, H., "Statistical Disambiguation of Multi-Character Keys Applied to Reduce Motor Requirements for Augmentative and Alternative Communication" AAC Augmentative and Alternative Communication, 1987.
- Kamphuis, H., and Soede, M., "Katdas: A Small Number of Keys Direct Access System", Resna 12 th Annual Conference, Louisiana, 1989.
Patent History
Type: Grant
Filed: Jul 3, 1999
Date of Patent: Apr 17, 2001
Assignee: Eaton: Ergonomics, Inc. (New York, NY)
Inventor: Howard Gutowitz (New York, NY)
Primary Examiner: Thomas G. Black
Assistant Examiner: Uyen Le
Application Number: 09/347,188
International Classification: G06F/1338; G06F/1312;


text:
This has been quite a successful year for Victoria Beckham. The opening of her first flagship store in Dover Street, London is counting a few months of life and I am a huge fan of her collections. I love the minimalistic lines, colours and simplicity of her designs. It's all about being comfortable, classy and feeling feminine at the same time. A little Victoria Beckham dress is really missing from my wardrobe, but we will get there...eventually!
The designer is expanding her empire via a nails collection created with Nails Inc. Two shades - the nude Bamboo White (my favorite) and the orangey Judo Red - will launch as a collaboration between Victoria Victoria Beckham and the British nail brand.
|Source: vogue.co.uk
Available on Nailsinc.com from December 8 or in store from February.
Have a great Sunday loves!!


text:
Cart is empty
1 Pair of Euro L.E.D. Tail Lights (Left & Right). Chrome Lenses
Fits Model Year 94-02 Dodge 2500-3500 Trucks
Also Fits 94-01 Dodge 1500 Trucks
Add the finishing touches to your truck with our extensive line of new L.E.D. Tail Lights for your vehicle.
The L.E.D. Tail Lights fire up a powerful light that is more durable, long lasting, & more energy-efficient than standard lighting technology.
Comes with Individual Sockets which makes it easy to change if any of them goes out.
The L.E.D. Tail Light kits provide an upgrade for your vehicle and provides the satisfaction of having the latest Euro look on your truck!!
LED tail lights are the revolution of tail lights. Where it is only found in high-priced luxury vehicles in the past, LED tail lights have been making its way into many other vehicles on the road today. Replacing the traditional light bulbs with a sets of individual Light Emitting Diode or more commonly known as LED, LED tail lights are the perfect performance and safety enhancement for your car.
Consisting of individually illuminated LED, our range of LED tail lights are the perfect after-market product for any enthusiast or daily commuter as it provides higher lighting intensity output when braking, and during signaling indications. At the same time, LED tail lights improves appearance of your car!
These tail lights have a 90 day limited warranty.
No posts found